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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1049; p. 115365
Main Authors:	Chakraborty, Dibyayan, Vaxès, Yann
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 17.09.2025
Subjects:	Approximation algorithms Hyperbolicity Isometric paths Minimum eccentricity shortest paths Approximation algorithms Hyperbolicity Isometric paths Minimum eccentricity shortest paths
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!