Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
暂无分享,去创建一个
Ola Svensson | Monaldo Mastrolilli | Christoph Ambühl | O. Svensson | Christoph Ambühl | M. Mastrolilli
[1] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[2] Luca Trevisan,et al. Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..
[3] David B. Shmoys,et al. Cut problems and their application to divide-and-conquer , 1996 .
[4] Yuval Rabani,et al. On the Hardness of Approximating Multicut and Sparsest-Cut , 2005, Computational Complexity Conference.
[5] Shimon Kogan,et al. Hardness of approximation of the Balanced Complete Bipartite Subgraph problem , 2004 .
[6] James R. Lee,et al. An improved approximation ratio for the minimum linear arrangement problem , 2007, Inf. Process. Lett..
[7] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[8] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[9] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[10] Uriel Feige,et al. Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[11] Mohammad Taghi Hajiaghayi,et al. L22 Spreading Metrics for Vertex Ordering Problems , 2006, SODA.
[12] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[13] O. Svensson,et al. Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, FOCS 2007.
[14] Elad Hazan,et al. O(/spl radic/log n) approximation to SPARSEST CUT in O/spl tilde/(n/sup 2/) time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[15] René Peeters,et al. The maximum edge biclique problem is NP-complete , 2003, Discret. Appl. Math..
[16] Nisheeth K. Vishnoi,et al. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/ , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] Prasad Raghavendra,et al. Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.
[18] Farhad Shahrokhi,et al. Sparsest cuts and bottlenecks in graphs , 1990, Discret. Appl. Math..
[19] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.
[20] Satish Rao,et al. New Approximation Techniques for Some Linear Ordering Problems , 2005, SIAM J. Comput..
[21] Ola Svensson,et al. Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[22] Anupam Gupta,et al. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.
[23] Piotr Berman,et al. On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..
[24] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[25] Subhash Khot,et al. A strong inapproximability gap for a generalization of minimum bisection , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[26] George M. Church,et al. Biclustering of Expression Data , 2000, ISMB.
[27] JOSEP DÍAZ,et al. A survey of graph layout problems , 2002, CSUR.
[28] Sanjeev Arora,et al. 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time , 2004, FOCS.
[29] Nisheeth K. Vishnoi,et al. Integrality gaps for sparsest cut and minimum linear arrangement problems , 2006, STOC '06.
[30] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[31] 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.
[32] Milind Dawande,et al. On Bipartite and Multipartite Clique Problems , 2001, J. Algorithms.
[33] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[34] Nisheeth K. Vishnoi,et al. Unique games on expanding constraint graphs are easy: extended abstract , 2008, STOC.