id: 06013533
dt: a
an: 06013533
au: Chimani, Markus; Gutwenger, Carsten
ti: Advances in the planarization method: Effective multiple edge insertions.
so: van Kreveld, Marc (ed.) et al., Graph drawing. 19th international
    symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23,
    2011. Revised selected papers. Berlin: Springer (ISBN
    978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 87-98
    (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-25878-7_10
ab: Summary: The planarization method is the strongest known method to
    heuristically find good solutions to the general crossing number
    problem in graphs: starting from a planar subgraph, one iteratively
    inserts edges, representing crossings via dummy nodes. In the recent
    years, several improvements both from the practical and the theoretical
    point of view have been made. We review these advances and conduct an
    extensive study of the algorithms’ practical implications. Thereby,
    we present the first implementation of an approximation algorithm for
    the crossing number problem of general graphs, and compare the obtained
    results with known exact crossing number solutions.
rv: