---
res:
bibo_abstract:
- "Bundling crossings is a strategy which can enhance the readability\r\nof graph
drawings. In this paper we consider good drawings, i.e., we require that\r\nany
two edges have at most one common point which can be a common vertex or a\r\ncrossing.
Our main result is that there is a polynomial-time algorithm to compute an\r\n8-approximation
of the bundled crossing number of a good drawing with no toothed\r\nhole. In general
the number of toothed holes has to be added to the 8-approximation.\r\nIn the
special case of circular drawings the approximation factor is 8, this improves\r\nupon
the 10-approximation of Fink et al. [14]. Our approach also works with the same\r\napproximation
factor for families of pseudosegments, i.e., curves intersecting at most\r\nonce.
We also show how to compute a 9/2-approximation when the intersection graph of\r\nthe
pseudosegments is bipartite and has no toothed hole.@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Alan M
foaf_name: Arroyo Guevara, Alan M
foaf_surname: Arroyo Guevara
foaf_workInfoHomepage: http://www.librecat.org/personId=3207FDC6-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0003-2401-8670
- foaf_Person:
foaf_givenName: Stefan
foaf_name: Felsner, Stefan
foaf_surname: Felsner
bibo_doi: 10.7155/jgaa.00629
bibo_issue: '6'
bibo_volume: 27
dct_date: 2023^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/1526-1719
dct_language: eng
dct_publisher: Brown University@
dct_title: Approximating the bundled crossing number@
...