Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs

DOI10.1007/978-3-319-49787-7_6zbMath1398.68668OpenAlexW2964025835MaRDI QIDQ1989499

Iraj Saniee, Sean Kennedy, Katherine Edwards

Publication date: 26 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-49787-7_6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items

Parameterized approximation algorithms for some location problems in graphs ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs ⋮ Fellow travelers phenomenon present in real-world networks ⋮ Gromov hyperbolicity in Mycielskian graphs

This page was built for publication: Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs