Approximating the Crossing Number of Apex Graphs

  • Markus Chimani
  • Petr Hliněný
  • Petra Mutzel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5417)

Abstract

We show that the crossing number of an apex graph, i.e. a graph G from which only one vertex v has to be removed to make it planar, can be approximated up to a factor of Δ(G − vd(v)/2 by solving the vertex inserting problem, i.e. inserting a vertex plus incident edges into an optimally chosen planar embedding of a planar graph. Due to a recently developed polynomial algorithm for the latter problem, this establishes the first polynomial fixed-constant approximation algorithm for the crossing number problem of apex graphs with bounded degree.

Keywords

Crossing number apex graph vertex insertion 

References

  1. 1.
    Cabello, S., Mohar, B.: Crossing and weighted crossing number of near planar graphs. In: GD 2008. LNCS, vol. 5417. Springer, Heidelberg (2009)Google Scholar
  2. 2.
    Chimani, M., Gutwenger, C., Mutzel, P., Wolf, C.: Inserting a vertex into a planar graph. In: ACM-SIAM Symposium on Discrete Algorithms (to appear, 2009)Google Scholar
  3. 3.
    Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica 41, 289–308 (2005)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Hliněný, P., Salazar, G.: On the Crossing Number of Almost Planar Graphs. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 162–173. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore MD, USA (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Markus Chimani
    • 1
  • Petr Hliněný
    • 2
  • Petra Mutzel
    • 1
  1. 1.Faculty of CSDortmund University of TechnologyGermany
  2. 2.Faculty of InformaticsMasaryk UniversityBrnoCzech Republic

Personalised recommendations