Sparsest cuts and bottlenecks in graphs
Discrete Applied Mathematics - Computational combinatiorics
On the complexity of approximating the independent set problem
Information and Computation
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximation algorithms
On bipartite and multipartite clique problems
Journal of Algorithms
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Biclustering of Expression Data
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n2) Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
New Approximation Techniques for Some Linear Ordering Problems
SIAM Journal on Computing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
l22 spreading metrics for vertex ordering problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Integrality gaps for sparsest cut and minimum linear arrangement problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
Computational Complexity
An improved approximation ratio for the minimum linear arrangement problem
Information Processing Letters
Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique
SIAM Journal on Computing
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
Unique games on expanding constraint graphs are easy: extended abstract
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
A note on a Maximum k-Subset Intersection problem
Information Processing Letters
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
d-dimensional arrangement revisited
Information Processing Letters
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Domination analysis of algorithms for bipartite boolean quadratic programs
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Multi-tuple deletion propagation: approximations and complexity
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approximation scheme, unless NP-complete problems can be solved in randomized subexponential time. Furthermore, we show that the same techniques can be used for the Maximum Edge Biclique problem, for which we obtain a hardness factor similar to previous results but under a more standard assumption.