Inapproximability of Combinatorial Optimization Problems

  title={Inapproximability of Combinatorial Optimization Problems},
  author={Luca Trevisan},
  journal={Electron. Colloquium Comput. Complex.},
  • L. Trevisan
  • Published 23 September 2004
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
We survey results on the hardness of approximating combinatorial optimization problems. 

Figures from this paper

Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
It is proved that the scheduling problem is as-hard to approximate as vertex cover when the so-called fixed cost, that is present in all feasible solutions, is subtracted from the objective function.
A survey on the structure of approximation classes
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
The Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem are considered and it is shown that they have no polynomial time approximation scheme, unless NP-complete problems can be solved in randomized subexponential time.
On the Approximability of the Sum-Max Graph Partitioning Problem
It is proved, in addition to the NP and W[1] hardnesses (for the parameter k), that there is no p-approximation algorithm for any p in O(n^{1-\epsilon}), given any fixed 0 < 0 < 1 <= 1 (unless P=NP).
Some topics in analysis of boolean functions
This article gives a brief introduction to Fourier analysis of boolean functions and discusses some applications: Arrow's Theorem and other ideas from the theory of Social Choice; the Bonami-Beckner Inequality as an extension of Chernoff/Hoeffding bounds to higher-degree polynomials; and, hardness for approximation algorithms.
Semidefinite Programming and Approximation Algorithms: A Survey
Semidefinite programming (a form of convex programming in which the variables are vector inner products) has been used to design the current best approximation algorithms for problems such as MAX-CUT, MAX-3SAT, SPARSEST CUT, GRAPH COLORED, etc.
On Parameterized Inapproximability of Several Optimization Problems
In this thesis, we study the parameterized inapproximability of several optimization problems. Approximation algorithms and parameterized complexity are two powerful methods to deal with hard
Guest column: the elusive inapproximability of the TSP
The main tools and techniques used in the currently best known approximation lower bounds for the famous Traveling Salesman Problem are described, including expander-like graph constructions called amplifiers and bounded-occurrence instances of standard constraint satisfaction problems.
On the Approximability of the Minimum Subgraph Diameter Problem
This work addresses the minimum subgraph diameter problem (MSDP) by answering an open question with respect to its approximability. Given a graph with lengths and costs associated to its edges, the
Label Cover Algorithms via the Log-Density Threshold
This paper focuses on a problem called Label Cover, in which a bipartite graph G = (L, R, E), a constraint πe on each edge e, and a label set Σ is given; the goal is to label the vertices so as to satisfy as many constraints as possible.


Approximation thresholds for combinatorial optimization problems
  • U. Feige
  • Computer Science, Mathematics
  • 2003
Some of the known approximation threshold results are surveyed, and the pattern that emerges from the known results is discussed.
On the hardness of approximating minimum vertex cover
We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique. To that end, one needs to
The importance of being biased
(MATH) We show that the Minimum Vertex Cover problem is NP-hard to approximate to within any factor smaller than $10\sqrt{5}-21 \approx 1.36067$, improving on the previously known hardness result for
Hardness of approximating the Shortest Vector Problem in high lp norms
  • Subhash Khot
  • Mathematics, Computer Science
    J. Comput. Syst. Sci.
  • 2006
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
A randomized algorithm for transforming an optimal solution of a relaxed problem into a provably good solution for the 0–1 problem is given and can be extended to provide bounds on the disparity between the rational and 0-1 optima for a given problem instance.
Proving Integrality Gaps without Knowing the Linear Program
An integrality gap of 2−o(1) is proved for three families of linear relaxations for vertex cover for NP optimization problems, and the methods seem relevant to other problems as well.
Approximation Algorithms for the Set Covering and Vertex Cover Problems
  • D. Hochbaum
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1982
We propose a heuristic that delivers in $O(n^3 )$ steps a solution for the set covering problem the value of which does not exceed the maximum number of sets covering an element times the optimal
P-Complete Approximation Problems
For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is