Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
暂无分享,去创建一个
[1] Luca Trevisan,et al. Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems , 2018, ArXiv.
[2] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[3] Sepehr Abbasi Zadeh. Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies , 2018 .
[4] Guy Kindler,et al. On non-optimally expanding sets in Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[5] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[6] Subhash Khot,et al. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[7] Yuan Zhou,et al. Approximability and proof complexity , 2012, SODA.
[8] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[9] Subhash Khot,et al. Optimal Long Code Test with One Free Bit , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[10] Uriel Feige,et al. Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[11] A KhotSubhash,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1 , 2015 .
[12] Yuval Rabani,et al. On the Hardness of Approximating Multicut and Sparsest-Cut , 2005, Computational Complexity Conference.
[13] Guy Kindler,et al. Towards a proof of the 2-to-1 games conjecture? , 2018, Electron. Colloquium Comput. Complex..
[14] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[15] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[16] Sanjeev Arora,et al. Euclidean distortion and the sparsest cut , 2005, Symposium on the Theory of Computing.
[17] George Karakostas,et al. A better approximation ratio for the vertex cover problem , 2005, TALG.
[18] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[19] Mohammad Taghi Hajiaghayi,et al. l22 spreading metrics for vertex ordering problems , 2006, SODA '06.
[20] Subhash Khot,et al. Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[21] Sanjeev Arora,et al. Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[22] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[23] James R. Lee,et al. Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.
[24] Yuan Zhou,et al. Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems , 2014, ITCS.
[25] Yurii Nesterov,et al. Squared Functional Systems and Optimization Problems , 2000 .
[26] Moses Charikar,et al. Local Global Tradeoffs in Metric Embeddings , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[27] Ewald Speckenmeyer,et al. Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.
[28] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[29] Nikhil Bansal,et al. New Tools and Connections for Exponential-Time Approximation , 2017, Algorithmica.
[30] P. Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .
[31] James R. Lee,et al. On distance scales, embeddings, and efficient relaxations of the cut cone , 2005, SODA '05.
[32] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[33] James R. Lee,et al. An improved approximation ratio for the minimum linear arrangement problem , 2007, Inf. Process. Lett..
[34] Prasad Raghavendra,et al. Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[35] Russell Impagliazzo,et al. Improved Algorithms for Unique Games via Divide and Conquer , 2010, Electron. Colloquium Comput. Complex..
[36] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[37] Konstantinos Georgiou,et al. Better Balance by Being Biased , 2016, ACM Trans. Algorithms.
[38] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[39] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[40] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[41] David Steurer,et al. Sum-of-squares proofs and the quest toward optimal algorithms , 2014, Electron. Colloquium Comput. Complex..
[42] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[43] Yuan Zhou,et al. Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.
[44] Russell Impagliazzo,et al. On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..
[45] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[46] Dima Grigoriev,et al. Complexity of Positivstellensatz proofs for the knapsack , 2002, computational complexity.
[47] Jean B. Lasserre,et al. An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..
[48] Venkatesan Guruswami,et al. Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[49] Ryan O'Donnell,et al. Sum of squares lower bounds for refuting any CSP , 2017, STOC.
[50] Prasad Raghavendra,et al. Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.