Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
暂无分享,去创建一个
Prasad Raghavendra | Venkatesan Guruswami | Rajsekar Manokaran | P. Raghavendra | V. Guruswami | R. Manokaran
[1] Elchanan Mossel. Gaussian Bounds for Noise Correlation of Functions , 2007, FOCS 2007.
[2] Alantha Newman,et al. Approximating the Maximum Acyclic Subgraph , 2000 .
[3] Joseph Naor,et al. Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.
[4] Madhu Sudan,et al. Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[5] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[6] Elchanan Mossel,et al. Noise stability of functions with low influences: Invariance and optimality , 2005, IEEE Annual Symposium on Foundations of Computer Science.
[7] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[8] Johan Håstad. Every 2-CSP allows nontrivial approximation , 2005, STOC '05.
[9] Vijaya Ramachandran,et al. Finding a Minimum Feedback Arc Set in Reducible Flow Graphs , 1988, J. Algorithms.
[10] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[11] Moses Charikar,et al. On the Advantage over Random for Maximum Acyclic Subgraph , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[12] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.
[13] C. Lucchesi,et al. A Minimax Theorem for Directed Graphs , 1978 .
[14] Bruce A. Reed,et al. Packing directed circuits , 1996, Comb..
[15] Paul D. Seymour,et al. Packing directed circuits fractionally , 1995, Comb..
[16] Bonnie Berger,et al. Tight Bounds for the Maximum Acyclic Subgraph Problem , 1997, J. Algorithms.
[17] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[18] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-epsilon , 2008, J. Comput. Syst. Sci..
[19] Alantha Newman. Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem , 2004, APPROX-RANDOM.
[20] Prasad Raghavendra,et al. Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling , 2008, STOC.