Some optimal inapproximability results

@article{Hstad2001SomeOI,
  title={Some optimal inapproximability results},
  author={Johan H{\aa}stad},
  journal={Electron. Colloquium Comput. Complex.},
  year={2001},
  volume={TR97}
}
  • J. Håstad
  • Published 1 July 2001
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
We prove optimal, up to an arbitrary ε > 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds for the efficient approximability of many optimization problems studied previously. In particular, for Max-E2-Sat, Max-Cut, Max-di-Cut, and Vertex cover. 

Inapproximability Results for Bounded Variants of Optimization Problems

NP-hardness factor is proved for Max-3DM and Max-4DM; in both cases the hardness result applies even to instances with exactly two occurrences of each element.

On the inapproximability of maximum intersection problems

Inapproximability Ratios for Crossing Number

  • R. Pocai
  • Mathematics
    Electron. Notes Discret. Math.
  • 2017

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

It is shown that assuming the UGC, for every k ≥ 2, the problem is inapproximable within k - e even when the hypergraph is almost k-partite, which is stronger and simpler than previous results.

Improved Inapproximability for TSP

An essentially different construction and also relying on the work of Berman and Karpinski on bounded occurrence CSPs, an alternative and simpler inapproximability proof is given which improves the bound to \(\frac{185}{184}\).

Complexity of approximating bounded variants of optimization problems

Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs

It is shown that Approximating the size of the minimum vertex cover in O(1)-regular hypergraphs to within a factor of 1.99999 is NP-hard.

Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies

We present in this paper some of the recent techniques and methods for proving best up to now explicit approximation hardness bounds for metric symmetric and asymmetric Traveling Salesman Problem

Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs

We prove that Minimum Vertex Cover on k-uniform hypergraphs is NP-hard to approximate within ?(k1-?). The result follows by a new reduction and a PCP characterization of NP by Hastad and Khot [11].

Approximating MAX SAT by moderately exponential and parameterized algorithms

...

References

SHOWING 1-10 OF 42 REFERENCES

Some optimal inapproximability results

  • J. Håstad
  • Computer Science, Mathematics
    STOC '97
  • 1997
We prove optimal, up to an arbitrary 2 > 0, inapproximability results for Max-Ek-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations

Improved non-approximability results

Strong non-approximability factors for central problems are indicated: N{Sup 1/4} for Max Clique; N{sup 1/10} for Chromatic Number; and 66/65 for Max 3SAT.

Efficient probabilistic checkable proofs and applications to approximation

We construct multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size. As a consequence, we obtain

Approximation algorithms for combinatorial problems

For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(nε), where n is the problem size and ε> 0 depends on the algorithm.

Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

  • U. FeigeM. Goemans
  • Computer Science, Mathematics
    Proceedings Third Israel Symposium on the Theory of Computing and Systems
  • 1995
The approach combines the Feige-Lovasz (STOC92) semidefinite programming relaxation of one-round two-prover proof systems, together with rounding techniques for the solutions of semideFinite programs, as introduced by Goemans and Williamson (SToc94).

Efficient probabilistically checkable proofs and applications to approximations

This work constructs multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size, and shows that approximating minimum set cover within any constant is NP-complete.

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.

Gadgets, approximation, and linear programming

The authors present a linear-programming based method for finding "gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A key step in

Free bits, PCPs and non-approximability-towards tight results

A proof system for NP is presented using logarithmic randomness and two amortized free bits, so that Max clique is hard within N/sup 1/3/ and chromatic number within N-Sup 1/5/, and a comprehensive study of PCP and FPCP parameters is initiated.

Optimization, approximation, and complexity classes

A natural variant of NP, MAX NP, and also a subclass called MAX SNP are defined, which contain several natural, well-studied classes of optimization problems, and it is shown that problems in these classes can be approximated with some bounded error.