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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1049; S. 115365
Hauptverfasser:	Chakraborty, Dibyayan, Vaxès, Yann
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 17.09.2025
Schlagworte:	Approximation algorithms Hyperbolicity Isometric paths Minimum eccentricity shortest paths Approximation algorithms Hyperbolicity Isometric paths Minimum eccentricity shortest paths
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!