An algorithm for the graph crossing number problem

We study the Minimum Crossing Number problem: given an n-vertex graph G, the goal is to find a drawing of G in the plane with minimum number of edge crossings. This is one of the central problems in topological graph theory, that has been studied extensively over the past three decades. The first non-trivial efficient algorithm for the problem, due to Leighton and Rao, achieved an O(n log4n)-approximation for bounded degree graphs. This algorithm has since been improved by poly-logarithmic factors, with the best current approximation ratio standing on O (n poly(d) log3/2n ) for graphs with maximum degree d. In contrast, only APX-hardness is known on the negative side. In this paper we present an efficient randomized algorithm to find a drawing of any n-vertex graph G in the plane with O(OPT10poly(d log n)) crossings, where OPT is the number of crossings in the optimal solution, and d is the maximum vertex degree in G. This result implies an ~O(n9/10poly(d))-approximation for Minimum Crossing Number, thus breaking the long-standing ~O(n)-approximation barrier for bounded-degree graphs.

[1]  Sudipto Guha,et al.  Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas , 2002, SIAM J. Comput..

[2]  J. Pach,et al.  Thirteen problems on crossing numbers , 2000 .

[3]  Petr Hlinený,et al.  Crossing Number Is Hard for Cubic Graphs , 2004, MFCS.

[4]  Shengjun Pan,et al.  The crossing number of K11 is 100 , 2007, J. Graph Theory.

[5]  Jingbin Yin,et al.  Crossing Numbers , 1998, JCDCG.

[6]  Markus Chimani,et al.  Approximating the Crossing Number of Apex Graphs , 2008, Graph Drawing.

[7]  P. Erdös,et al.  Crossing Number Problems , 1973 .

[8]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[9]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[10]  O. Svensson,et al.  Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, FOCS 2007.

[11]  Sanjeev Khanna,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[12]  David R. Wood,et al.  Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor , 2006, GD.

[13]  E. Szemerédi,et al.  Crossing-Free Subgraphs , 1982 .

[14]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[15]  Martin Grohe,et al.  Computing crossing numbers in quadratic time , 2000, STOC '01.

[16]  Petr Hlinený,et al.  Approximating the Crossing Number of Toroidal Graphs , 2007, ISAAC.

[17]  Amit Agarwal,et al.  O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.

[18]  László A. Székely.  Progress on Crossing Number Problems , 2005, SOFSEM.

[19]  George Pólya.  A note of welcome , 1977, J. Graph Theory.

[20]  János Pach,et al.  Planar Crossing Numbers of Graphs Embeddable in Another Surface , 2006, Int. J. Found. Comput. Sci..

[21]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[22]  Bruce A. Reed,et al.  Computing crossing number in linear time , 2007, STOC '07.

[23]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[24]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[25]  Bojan Mohar,et al.  Adding one edge to planar graphs makes crossing number hard , 2010, SCG.

[26]  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).

[27]  Petr Hliněný,et al.  The crossing number of a projective graph is quadratic in the face-width , 2007, Electron. Notes Discret. Math..

[28]  James R. Lee,et al.  Euclidean distortion and the sparsest cut , 2005, STOC '05.

[29]  Frank Thomson Leighton.  Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks , 2003 .

[30]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[31]  Jirí Matousek,et al.  Crossing number, pair-crossing number, and expansion , 2004, J. Comb. Theory, Ser. B.

[32]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[33]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[34]  Mihalis Yannakakis,et al.  Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..

[35]  János Pach,et al.  2 Two Important Bounds and Their Applications , 1994 .

[36]  Jason S. Williford,et al.  On the independence number of the Erdos-Rényi and projective norm graphs and a related hypergraph , 2007 .

[37]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[38]  Yury Makarychev,et al.  On graph crossing number and edge planarization , 2011, SODA '11.

[39]  Chandra Chekuri,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[40]  Markus Chimani,et al.  Approximating the crossing number of graphs embeddable in any orientable surface , 2010, SODA '10.

[41]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.