Construct · 1 fields · 1 citations

fully polynomial-time approximation scheme: 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

a family of algorithms reaching any error tolerance epsilon in time polynomial in both input size and 1/epsilon, first shown for knapsack.

In approximation algorithms, fully polynomial-time approximation scheme refers to a family of algorithms reaching any error tolerance epsilon in time polynomial in both input size and 1/epsilon, first shown for knapsack. This meaning comes from Ibarra (1975) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

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

See how fully polynomial-time approximation scheme 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

error4 fields · 8 citationsjingle · one word, four constructs family3 fields · 3 citationsjingle · one word, three constructs knapsack2 fields · 2 citationsinvariant · one hard problem, two systems

References

Ibarra, O. H., & Kim, C. E. (1975). Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. Journal of the ACM, 22(4), 463-468. https://doi.org/10.1145/321906.321909

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