--- res: bibo_abstract: - Bundling crossings is a strategy which can enhance the readability of graph drawings. In this paper we consider bundlings for families of pseudosegments, i.e., simple curves such that any two have share at most one point at which they cross. Our main result is that there is a polynomial-time algorithm to compute an 8-approximation of the bundled crossing number of such instances (up to adding a term depending on the facial structure). This 8-approximation also holds for bundlings of good drawings of graphs. In the special case of circular drawings the approximation factor is 8 (no extra term), this improves upon the 10-approximation of Fink et al. [6]. We also show how to compute a 92-approximation when the intersection graph of the pseudosegments is bipartite.@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.1007/978-3-030-96731-4_31 bibo_volume: 13174 dct_date: 2022^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/0302-9743 - http://id.crossref.org/issn/1611-3349 - http://id.crossref.org/issn/9783030967307 dct_language: eng dct_publisher: Springer Nature@ dct_title: Approximating the bundled crossing number@ ...