Publication details
Approximating the Crossing Number of Toroidal Graphs
| Authors | |
|---|---|
| Year of publication | 2007 |
| Type | Article in Proceedings |
| Conference | International Symposium on Algorithms and Computation (ISAAC 2007) |
| MU Faculty or unit | |
| Citation | |
| Web | |
| Field | Informatics |
| Keywords | crossing number; crossing minimization; approximation |
| Description | CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time constant approximation algorithm is known for this NP-complete problem. We prove that a natural approach to planar drawing of toroidal graphs (used already by Pach and T\'oth) gives a polynomial time constant approximation algorithm for the crossing number of toroidal graphs with bounded degree. In this proof we present a new ``grid'' theorem on toroidal graphs. |