Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs

For an integer k≥1, the objective of k-Geodesic Center is to find a set C of k isometric paths such that the maximum distance between any vertex v and C is minimised. Introduced by Gromov, δ-hyperbolicity measures how treelike a graph is from a metric point of view. Our main contribution in this pap...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1049; s. 115365
Hlavní autori:	Chakraborty, Dibyayan, Vaxès, Yann
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 17.09.2025
Predmet:	Approximation algorithms Hyperbolicity Isometric paths Minimum eccentricity shortest paths Approximation algorithms Hyperbolicity Isometric paths Minimum eccentricity shortest paths
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!