Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut

SIAM Journal on Computing

Volumn 40, Issue 2, 2011, Pages 567-596

  Ambühl, Christoph ^a   Mastrolilli, Monaldo ^b   Svensson, Ola ^c  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Graph theory; Hardness of approximation

Indexed keywords

BICLIQUE; GRAPH PROBLEMS; HARDNESS FACTOR; HARDNESS OF APPROXIMATION; INAPPROXIMABILITY; MINIMUM LINEAR ARRANGEMENT; NP COMPLETE PROBLEMS; NP-HARD; POLYNOMIAL TIME APPROXIMATION SCHEMES; SPARSEST CUT; STANDARD ASSUMPTIONS; SUBEXPONENTIAL TIME;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HARDNESS;

POLYNOMIAL APPROXIMATION;

EID: 79957484219     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080729256     Document Type: Article

References (32)

1. C. Ambühl, M. Mastrolilli, and O. Svensson, Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 329-337.
2. 2) time, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004, pp. 238-247. (Pubitemid 40575285)
3. S. Arora, S. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. K. Vishnoi, Unique games on expanding constraint graphs are easy: Extended abstract, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), 2008, pp. 21-28.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555. (Pubitemid 128506634)
5. S. Arora, S. Rao, and U. V. Vazirani, Expander flows, geometric embeddings and graph partitioning, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), 2004, pp. 222-231.
6. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122. (Pubitemid 128615465)
7. P. Berman and G. Schnitger, On the complexity of approximating the independent set problem, Inform. and Comput., 96 (1992), pp. 77-94.
8. M. Charikar, M. T. Hajiaghayi, H. Karloff, and S. Rao, l2 2 spreading metrics for vertex ordering problems, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 1018-1027. (Pubitemid 43275328)
9. S. Chawla, A. Gupta, and H. Räcke, Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut, ACM Trans. Algorithms, 4 (2008), pp. 1-18.
10. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar, On the hardness of approximating multicut and sparsest-cut, Comput. Complexity, 15 (2006), pp. 94-114. (Pubitemid 43938397)
11. Y. Cheng and G. M. Church, Biclustering of expression data, in Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000, pp. 93-103.
12. M. Dawande, P. Keskinocak, J. M. Swaminathan, and S. Tayur, On bipartite and multipartite clique problems, J. Algorithms, 41 (2001), pp. 388-403. (Pubitemid 33665547)
13. N. R. Devanur, S. Khot, R. Saket, and N. K. Vishnoi, Integrality gaps for sparsest cut and minimum linear arrangement problems, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 2006, pp. 537-546. (Pubitemid 44306588)
14. N. R. Devanur, S. A. Khot, R. Saket, and N. K. Vishnoi, On the Hardness of Minimum Linear Arrangement, manuscript, 2005.
15. J. Díaz, J. Petit, and M. Serna, A survey of graph layout problems, ACM Comput. Surveys, 34 (2002), pp. 313-356.
16. U. Feige, Relations between average case complexity and approximation complexity, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 534-543. (Pubitemid 35009414)
17. U. Feige and S. Kogan, Hardness of Approximation of the Balanced Complete Bipartite Subgraph Problem, Technical report MCS04-04, Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel, 2004.
18. U. Feige and J. R. Lee, An improved approximation ratio for the minimum linear arrangement problem, Inform. Process. Lett., 101 (2007), pp. 26-29. (Pubitemid 44635488)
19. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
20. J. Holmerin and S. Khot, A strong inapproximability gap for a generalization of minimum bisection, in Proceedings of the 18th Annual IEEE Conference on Computational Complexity (CCC), 2003, pp. 371-378.
21. S. Khot, On the power of unique 2-prover 1-round games, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 767-775. (Pubitemid 35009440)
22. S. Khot, Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique, SIAM J. Comput., 36 (2006), pp. 1025-1071. (Pubitemid 47246876)
23. S. Khot and N. K. Vishnoi, The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l1, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2005, pp. 53-62. (Pubitemid 44375719)
24. F. T. Leighton and S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46 (1999), pp. 787-832.
25. D. W. Matula and F. Shahrokhi, Sparsest cuts and bottlenecks in graphs, Discrete Appl. Math., 27 (1990), pp. 113-123.
26. R. Peeters, The maximum edge biclique problem is NP-complete, Discrete Appl. Math., 131 (2003), pp. 651-654.
27. P. Raghavendra and D. Steurer, Graph expansion and the unique games conjecture, in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), 2010, pp. 755-764.
28. P. Raghavendra, D. Steurer, and M. Tulsiani, Reductions between expansion problems, Electron. Colloq. Comput. Complexity, 17 (2010), article 172.
29. S. Rao and A. W. Richa, New approximation techniques for some linear ordering problems, SIAM J. Comput., 34 (2004), pp. 388-404.
30. D. B. Shmoys, Cut problems and their application to divide-and-conquer, in Approximation Algorithms for NP-Hard Problems, PWS, Boston, 1997, pp. 192-235.
31. L. Trevisan, Inapproximability of Combinatorial Optimization Problems, ECCC report TR04-065; available online from http://www.eccc.uni-trier.de/report/ 2004/065/ (2004).
32. V. V. Vazirani, Approximation Algorithms, Springer-Verlag, Berlin, 2001.