On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
暂无分享,去创建一个
[1] Elchanan Mossel,et al. Approximation Resistant Predicates from Pairwise Independence , 2008, Computational Complexity Conference.
[2] Jonas Holmerin,et al. Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs , 2002, ICALP.
[3] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[4] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[5] Roberto Solis-Oba,et al. Reducing the Size of NFAs by Using Equivalences and Preorders , 2005, CPM.
[6] Venkatesan Guruswami,et al. Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon) , 2002, Electron. Colloquium Comput. Complex..
[7] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[8] Subhash Khot,et al. Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems , 2010, ICALP.
[9] Prasad Raghavendra,et al. Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling , 2008, STOC.
[10] Luca Trevisan,et al. Gowers Uniformity, Influence of Variables, and PCPs , 2009, SIAM J. Comput..
[11] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-epsilon , 2008, J. Comput. Syst. Sci..
[12] Elchanan Mossel,et al. Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[13] Ryan O'Donnell,et al. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..
[14] Ron Holzman,et al. On a theorem of lovász on covers inr-partite hypergraphs , 1996, Comb..
[15] Luca Trevisan,et al. Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.
[16] Nisheeth K. Vishnoi,et al. On the Optimality of a Class of LP-based Algorithms , 2009, Electron. Colloquium Comput. Complex..
[17] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[18] Venkatesan Guruswami,et al. A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..
[19] Irit Dinur,et al. The importance of being biased , 2002, STOC '02.
[20] Georg Gottlob,et al. Schema mapping discovery from data instances , 2010, JACM.
[21] Rajeev Motwani,et al. Online Distributed Predicate Evaluation , 2003 .