DocumentCode
3379650
Title
On the hardness of approximating MULTICUT and SPARSEST-CUT
Author
Chawla, Shuchi ; Krauthgamer, Robert ; Kumar, Ravi ; Rabani, Yuval ; Sivakumar, D.
Author_Institution
Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear
2005
fDate
11-15 June 2005
Firstpage
144
Lastpage
153
Abstract
We show that the MULTICUT, SPARSEST-CUT, and MIN-2CNF≡DELETION problems are NP-hard to approximate within every constant factor, assuming the unique games conjecture of Khot [STOC, 2002]. A quantitatively stronger version of the conjecture implies inapproximability factor of Ω(log log n).
Keywords
approximation theory; computational complexity; game theory; graph theory; MIN-2CNF≡DELETION problem; MULTICUT problem; NP-hard problem; SPARSEST-CUT problem; approximation hardness; multicut approximation; sparsest-cut approximation; unique games; Approximation algorithms; Computer science; Costs; Linear programming; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on
ISSN
1093-0159
Print_ISBN
0-7695-2364-1
Type
conf
DOI
10.1109/CCC.2005.20
Filename
1443081
Link To Document