Additive approximation algorithm for geodesic centers in -hyperbolic graphs
D Chakraborty, Y Vaxès - arXiv preprint arXiv:2404.03812, 2024 - arxiv.org
For an integer $ k\geq 1$, the objective of\textsc {$ k $-Geodesic Center} is to find a set
$\mathcal {C} $ of $ k $ isometric paths such that the maximum distance between any vertex …
$\mathcal {C} $ of $ k $ isometric paths such that the maximum distance between any vertex …
The Traveling Salesman Problem on the Hyperbolic Plane
This paper is concerned with the traveling salesman problem (TSP) on the two-dimensional
hyperbolic space. We provide an efficient heuristic to find near optimal tour along the cities …
hyperbolic space. We provide an efficient heuristic to find near optimal tour along the cities …