On the NP-hardness of Max-Not-2
2012 (English)In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Springer-Verlag , 2012, 170-181 p.Conference paper (Refereed)
We prove that, for any ε > 0, it is NP-hard to, given a satisfiable instance of Max-NTW (Not-2), find an assignment that satisfies a fraction 5/8 + ε of the constraints. This, up to the existence of ε, matches the approximation ratio obtained by the trivial algorithm that just picks an assignment at random and thus the result is tight. Said equivalently the result proves that Max-NTW is approximation resistant on satisfiable instances and this makes our understanding of arity three Max-CSPs with regards to approximation resistance complete.
Place, publisher, year, edition, pages
Springer-Verlag , 2012. 170-181 p.
, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 7408 LNCS
Approximation ratios, IS approximation, NP-hard, NP-hardness, Combinatorial optimization, Approximation algorithms
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-104872DOI: 10.1007/978-3-642-32512-0_15ScopusID: 2-s2.0-84865289211ISBN: 978-364232511-3OAI: oai:DiVA.org:kth-104872DiVA: diva2:567830
15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012 and the 16th International Workshop on Randomization and Computation, RANDOM 2012, 15 August 2012 through 17 August 2012, Cambridge, MA
QC 201211142012-11-142012-11-142012-11-14Bibliographically approved