- hdl:10338.dmlcz/103883, MR 0408313. Trevisan, Luca (July 27, 2004),
Inapproximability of
Combinatorial Optimization Problems (PDF) CSE 533: The PCP Theorem...
- an
input for k = 3 {\displaystyle k=3} is
pictured on the right.
Inapproximability results show that the
greedy algorithm is
essentially the best-possible...
- and
Szegedy on the
inapproximability of
Independent Set and the
famous PCP theorem, that
modern tools for
proving inapproximability results were uncovered...
- In
graph theory, a
vertex cover (sometimes node cover) of a
graph is a set of
vertices that
includes at
least one
endpoint of
every edge of the graph....
-
factor better than O(n1 − ε),
unless P = NP. The
rough idea of
these inapproximability results is to form a
graph that
represents a
probabilistically checkable...
- Both are hard to
approximate closer than some
constant factor, an
inapproximability result that can be
strengthened under the
unique games conjecture...
- systems. He also
received the 2011 Gödel
Prize for his work on
optimal inapproximability results. In particular, he
improved the PCP
theorem (which won the...
- good polynomial-time approximation. The
problems for
which such an
inapproximability result would hold
include constraint satisfaction problems, which...
- 1137/S0097539796309764, ISSN 1095-7111 Håstad,
Johan (2001), "Some
optimal inapproximability results" (PDF),
Journal of the ACM, 48 (4): 798–859, CiteSeerX 10...
- ISBN 9781450374231, S2CID 207693360 Goldberg, L. A.; Jerrum, M. (July 2008), "
Inapproximability of the
Tutte polynomial",
Information and Com****tion, 206 (7): 908–929...
