Approximation-preserving reduction
id:
approximation-preserving-reduction-239-16747877
title:
Approximation-preserving reduction
text:
In computability theory and computational complexity theory, especially the study of approximation algorithms, an approximation-preserving reduction is an algorithm for transforming one optimization problem into another problem, such that the distance of solutions from optimal is preserved to some degree. Approximation-preserving reductions are a subset of more general reductions in complexity theory; the difference is that approximation-preserving reductions usually make statements on approxima
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for transforming one optimization problem into another
original url:
https://en.wikipedia.org/wiki/Approximation-preserving_reduction
date created:
date modified:
2023-07-23T10:04:32Z
main entity:
{"identifier":"Q25303750","url":"https://www.wikidata.org/entity/Q25303750"}
image:
fields total:
13
integrity:
14