Trevisan, Luca , Sorkin, Gregory B. , Sudan, Madhu and Williamson, David P. (1996) Gadgets, approximation, and linear programming. In: 37th Annual IEEE Symposium on Foundations of Computer Science, 14-16 October 1996 , Burlington, VT, USA .
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Library of Congress subject classification:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
|Sets:||Research centres and groups > Management Science Group
Departments > Management
|Date Deposited:||16 May 2011 12:51|
Actions (login required)
|Record administration - authorised staff only|