Skip to main content
Article thumbnail
Location of Repository

Gadgets, approximation, and linear programming

By Luca Trevisan, Gregory B. Sorkin, Madhu Sudan and David P. Williamson

Abstract

We 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 this method is a simple observation which limits the search space to a finite one. Using this new method we present a number of new, computer-constructed gadgets for several different reductions. This method also answers a question posed by Bellare, Goldreich, and Sudan [SIAM J. Comput., 27 (1998), pp. 804-915] of how to prove the optimality of gadgets: linear programming duality gives such proofs. The new gadgets, when combined with recent results of Håstad [Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 1-10], improve the known inapproximability results for MAX CUT and MAX DICUT, showing that approximating these problems to within factors of 16/17+ ∊ and 12/13+ ∊ , respectively, is NP-hard for every ∊ > 0. Prior to this work, the best-known inapproximability thresholds for both problems were 71/72 (M. Bellare, O. Goldreich, and M. Sudan [SIAM J. Comput., 27 (1998), pp. 804-915]). Without using the gadgets from this paper, the best possible hardness that would follow from Bellare, Goldreich, and Sudan and Håstad is 18/19. We also use the gadgets to obtain an improved approximation algorithm for MAX3 SAT which guarantees an approximation ratio of .801

Topics: QA75 Electronic computers. Computer science, QA76 Computer software
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
OAI identifier: oai:eprints.lse.ac.uk:35498
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.siam.org/journals/s... (external link)
  • http://eprints.lse.ac.uk/35498... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.