Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for Unique Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Local versus global properties of metric spaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower bounds for embeddings into L1
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the fourier tails of bounded functions over the discrete cube
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Integrality gaps for sparsest cut and minimum linear arrangement problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Information Processing Letters
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
Theoretical Computer Science
The multi-multiway cut problem
Theoretical Computer Science
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Path hitting in acyclic graphs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics
Partitioning graphs into balanced components
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Untangling the cross-lingual link structure of Wikipedia
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
MENTA: inducing multilingual taxonomies from wikipedia
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
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).