Other formats:
BibTeX
LaTeX
RIS
@inproceedings{722628,
author = {Hliněný, Petr and Salazar, Gelasio},
address = {Berlin},
booktitle = {International Symposium on Algorithms and Computation (ISAAC 2007)},
keywords = {crossing number; crossing minimization; approximation},
language = {eng},
location = {Berlin},
isbn = {978-3-540-77118-0},
pages = {148-159},
publisher = {Springer Verlag},
title = {Approximating the Crossing Number of Toroidal Graphs},
url = {http://www.nishizeki.ecei.tohoku.ac.jp/isaac07/},
year = {2007}
}
TY - JOUR
ID - 722628
AU - Hliněný, Petr - Salazar, Gelasio
PY - 2007
TI - Approximating the Crossing Number of Toroidal Graphs
PB - Springer Verlag
CY - Berlin
SN - 9783540771180
KW - crossing number
KW - crossing minimization
KW - approximation
UR - http://www.nishizeki.ecei.tohoku.ac.jp/isaac07/
N2 - 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.
ER -
HLINĚNÝ, Petr and Gelasio SALAZAR. Approximating the Crossing Number of Toroidal Graphs. In \textit{International Symposium on Algorithms and Computation (ISAAC 2007)}. Berlin: Springer Verlag, 2007, p.~148-159. ISBN~978-3-540-77118-0.
|
