INAPPROXIMABILITY RESULTS FOR MAXIMUM EDGE BICLIQUE, MINIMUM LINEAR ARRANGEMENT, AND SPARSEST CUT
2011 (English)In: SIAM journal on computing (Print), ISSN 0097-5397, E-ISSN 1095-7111, Vol. 40, no 2, 567-596 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2011. Vol. 40, no 2, 567-596 p.
hardness of approximation, graph theory
IdentifiersURN: urn:nbn:se:kth:diva-33691DOI: 10.1137/080729256ISI: 000289974100012ScopusID: 2-s2.0-79957484219OAI: oai:DiVA.org:kth-33691DiVA: diva2:418736
FunderEU, European Research Council, 226203
QC 201105242011-05-242011-05-162011-05-24Bibliographically approved