On the hardness of approximating MULTICUT and SPARSEST-CUT

On the hardness of approximating MULTICUT and SPARSEST-CUT

We show that the MULTICUT, SPARSEST-CUT, and MIN-2CNF/spl equiv/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 /spl Omega/(lo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chawla, S., Krauthgamer, R., Kumar, R., Rabani, Y., Sivakumar, D.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Approximation algorithms
Computer science
Costs
Linear programming
Mathematics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We show that the MULTICUT, SPARSEST-CUT, and MIN-2CNF/spl equiv/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 /spl Omega/(log log n).
ISSN:1093-0159
2575-8403
DOI:10.1109/CCC.2005.20