The regularity lemma and approximation schemes for dense problems

There are two main contributions of the present paper. In the first, we use the constructive version of the Regularity Lemma to give directly simple polynomial time approximation schemes for several graph "subdivision" problems in dense graphs including the Max Cut problem, the Graph Bisection problem, the Min l-way cut problem and Graph Separator problem. Arora, Karger and Karpinski (1992) gave the first PTASs for these problems whose running time is O(n/sup o(1/e2)/). Our PTASs have running time where the exponent of n is a constant independent of e. The central point here is that the Regularity Lemma provides an explanation of why these Max-SNP hard problems turn out to be easy in dense graphs. We also give a simple PTAS for dense versions of a special case of the Quadratic Assignment Problem (QAP).

[1]  Alan M. Frieze,et al.  Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[2]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[3]  Martin E. Dyer,et al.  Approximately Counting Hamilton Paths and Cycles in Dense Graphs , 1998, SIAM J. Comput..

[4]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[5]  Marek Karpinski,et al.  Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.

[6]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[7]  Martin E. Dyer,et al.  Approximately counting Hamilton cycles in dense graphs , 1994, SODA '94.

[8]  Vojtech Rödl,et al.  The Uniformity Lemma for hypergraphs , 1992, Graphs Comb..

[9]  W. Vega,et al.  MAX-CUT has a randomized approximation scheme in dense graphs , 1996, Random Struct. Algorithms.

[10]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[11]  Vojtech Rödl,et al.  The Algorithmic Aspects of the Regularity Lemma , 1994, J. Algorithms.

[12]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[13]  Panos M. Pardalos,et al.  Quadratic Assignment and Related Problems , 1994 .

[14]  M. Simonovits,et al.  Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[15]  Alan M. Frieze,et al.  Electronic Colloquium on Computational Complexity Polynomial Time Randomised Approximation Schemes for Tutte-grr Othendieck Invariants: the Dense Case , 2022 .

[16]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.