暂无分享,去创建一个
[1] Prasad Raghavendra,et al. A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.
[2] Michael R. Fellows,et al. Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.
[3] Liming Cai,et al. Advice Classes of Parameterized Tractability , 1997, Ann. Pure Appl. Log..
[4] Anupam Gupta,et al. Faster Exact and Approximate Algorithms for k-Cut , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[5] Prasad Raghavendra,et al. Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.
[6] Fahad Panolan,et al. Lossy kernelization , 2016, STOC.
[7] Michael R. Fellows,et al. Parameterized approximation via fidelity preserving transformations , 2012, J. Comput. Syst. Sci..
[8] 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).
[9] Mam Riess Jones. Color Coding , 1962, Human factors.
[10] Anupam Gupta,et al. An FPT Algorithm Beating 2-Approximation for k-Cut , 2017, SODA.
[11] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[12] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[13] Judy Goldsmith,et al. Nondeterminism Within P , 1993, SIAM J. Comput..
[14] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.
[15] Rolf Niedermeier,et al. Parameterized Complexity of Vertex Cover Variants , 2007, Theory of Computing Systems.
[16] Oded Goldreich,et al. On Promise Problems: A Survey , 2006, Essays in Memory of Shimon Even.
[17] Prasad Raghavendra,et al. Approximating CSPs with global cardinality constraints using SDP hierarchies , 2011, SODA.
[18] Vangelis Th. Paschos,et al. Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs , 2018, Discret. Optim..
[19] Uri Zwick,et al. A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems , 2001, Random Struct. Algorithms.
[20] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[21] Reuven Bar-Yehuda,et al. Using homogenous weights for approximating the partial cover problem , 2001, SODA '99.
[22] Ge Xia,et al. Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..
[23] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[24] Konstantinos Georgiou,et al. Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection , 2012, SODA.
[25] Michael Langberg,et al. Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.
[26] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[27] Subhash Khot,et al. Optimal Long Code Test with One Free Bit , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[28] Dániel Marx,et al. Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..
[29] Ewald Speckenmeyer,et al. Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.
[30] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[31] Stefan Kratsch,et al. Kernelization Lower Bounds by Cross-Composition , 2012, SIAM J. Discret. Math..
[32] Ge Xia,et al. Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..
[33] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[34] Irit Dinur,et al. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..
[35] Bar-YehudaReuven. Using Homogeneous Weights for Approximating the Partial Cover Problem , 2001 .
[36] Russell Impagliazzo,et al. Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[37] Per Austrin,et al. Balanced max 2-sat might not be the hardest , 2007, STOC '07.
[38] Subhash Khot,et al. On independent sets, 2-to-2 games, and Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[39] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[40] Guy Kindler,et al. On non-optimally expanding sets in Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[41] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[42] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[43] Jiawei Zhang,et al. An improved rounding method and semidefinite programming relaxation for graph partition , 2002, Math. Program..
[44] Rajiv Gandhi,et al. On set expansion problems and the small set expansion conjecture , 2015, Discret. Appl. Math..
[45] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[46] Uri Zwick,et al. Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.
[47] Guy Kindler,et al. Towards a proof of the 2-to-1 games conjecture? , 2018, Electron. Colloquium Comput. Complex..
[48] George Karakostas,et al. A better approximation ratio for the vertex cover problem , 2005, TALG.
[49] Subhash Khot,et al. Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[50] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[51] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[52] Bruno Simeone,et al. The maximum vertex coverage problem on bipartite graphs , 2014, Discret. Appl. Math..
[53] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-epsilon , 2008, J. Comput. Syst. Sci..
[54] Jiawei Zhang,et al. On approximation of max-vertex-cover , 2002, Eur. J. Oper. Res..
[55] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..