Construct · 1 fields · 1 citations

approximation ratio: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Approximation algorithms

the worst-case ratio between the value an efficient algorithm finds and the optimal value, used to rank heuristics for hard optimization problems.

In approximation algorithms, approximation ratio refers to the worst-case ratio between the value an efficient algorithm finds and the optimal value, used to rank heuristics for hard optimization problems. This meaning comes from Johnson (1974) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how approximation ratio sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

rank4 fields · 8 citationsjingle · one word, four constructs value6 fields · 12 citationsjingle · one name, six constructs

References

Johnson, D. S. (1974). Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3), 256-278. https://doi.org/10.1016/s0022-0000(74)80044-9

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct