Construct · 1 fields · 1 citations

label cover: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
label cover1 CONSTRUCTLabel coverARORA · APPROXIMATION

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 constraint problem over a bipartite graph with projection constraints, used as the starting point for many hardness of approximation reductions.

In approximation algorithms, label cover refers to a constraint problem over a bipartite graph with projection constraints, used as the starting point for many hardness of approximation reductions. This meaning comes from Arora (1997) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Next

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

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

Open in ColliderExport BibTeXReport this entry

Nearby constructs

cover2 fields · 4 citationsjingle · one word, two constructshardness of approximation1 fields · 1 citationsanchor · a standalone constructhardness4 fields · 4 citationsjingle · one word, four constructs

References

  1. Arora, S., Babai, L., Stern, J., & Sweedyk, Z. (1997). The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations. Journal of Computer and System Sciences, 54(2), 317-331. https://doi.org/10.1006/jcss.1997.1472

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