Construct · 1 fields · 1 citations

hardness of approximation: 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

proof that approximating an optimization problem within some factor is as hard as solving NP-complete problems, often derived from interactive or checkable proofs.

In approximation algorithms, hardness of approximation refers to proof that approximating an optimization problem within some factor is as hard as solving NP-complete problems, often derived from interactive or checkable proofs. This meaning comes from Feige (1996) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

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

See how hardness of approximation 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

factor3 fields · 4 citationsjingle · one word, three constructs hardness4 fields · 4 citationsjingle · one word, four constructs label cover1 fields · 1 citationsanchor · a standalone construct

References

Feige, U., Goldwasser, S., Lovász, L., Safra, S., & Szegedy, M. (1996). Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2), 268-292. https://doi.org/10.1145/226643.226652

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