Approximating the Crossing Number of Apex Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F09%3A00065851" target="_blank" >RIV/00216224:14330/09:00065851 - isvavai.cz</a>
Result on the web
<a href="http://www.gd2008.org/" target="_blank" >http://www.gd2008.org/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-00219-9_42" target="_blank" >10.1007/978-3-642-00219-9_42</a>

Result language
angličtina
Original language name
Approximating the Crossing Number of Apex Graphs
Original language description
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 $Delta(G-v)cdot d(v)/2$ by solving the emph{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 forthe crossing number problem of apex graphs with bounded degree.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Symposium Graph Drawing 2008, Lecture Notes in Computer Science
ISBN
9783642002182
ISSN
0302-9743
e-ISSN
—
Number of pages
3
Pages from-to
432-434
Publisher name
Springer Verlag
Place of publication
Berlin
Event location
Heraklion, Greece
Event date
Oct 21, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000264579700041

Similar results(10)