Searching for "On the hardness of approximating label-cover." – sorted by Relevance.
-
On the Hardness of Approximating Label Cover
- The Label-Cover problem was introduced in [ABSS93] and shown there to be quasiNP -hard to approximate
- Cited by 7 (0 self) – Add To MetaCart
-
The hardness of approximating spanner problems
- that it is hard to approximate the Label-Cover problem with this ratio unless N P ` DT IM E(npolylog n) [25
- Cited by 6 (1 self) – Add To MetaCart
-
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related
- m) for any ɛ > 0. Their proof uses the hardness of approximating Label Cover, and hence relies
- Cited by 84 (9 self) – Add To MetaCart

