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

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 this method is a simple observation which limits the search space to a finite one. Using this new method they present a number of new, computer-constructed gadgets for several different reductions. This method also answers the question of how to prove the optimality of gadgets-they show how LP duality gives such proofs. The new gadgets improve hardness results for MAX CUT and MAX DICUT, showing that approximating these problems to within factors of 60/61 and 44/45 respectively is NP-hard (improving upon the previous hardness of 71/72 for both problems). They also use the gadgets to obtain an improved approximation algorithm for MAX 3SAT which guarantees an approximation ratio of 0.801, This improves upon the previous best bound of 0.7704

Topics: QA75 Electronic computers. Computer science, QA76 Computer software
Year: 1996
OAI identifier: oai:eprints.lse.ac.uk:35886
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://ieeexplore.ieee.org/xpl... (external link)
  • http://eprints.lse.ac.uk/35886... (external link)
  • Suggested articles


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