Additive approximation algorithm for geodesic centers in -hyperbolic graphs

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites work

$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
A Best Possible Heuristic for the k-Center Problem
A new characterization of tree medians with applications to distributed sorting
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and $G^2$-connected medians
Algorithms and complexity for geodetic sets on partial grids
An O(n n)-time algorithm for the k-center problem in trees
An ABC-problem for location and consensus functions on graphs
Complexity and algorithms for isometric path cover on chordal graphs and beyond
Core congestion is inherent in hyperbolic networks
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Easy and hard bottleneck location problems
Fast approximation algorithms for $p$-centers in large $\delta$-hyperbolic graphs
Fast approximation and exact computation of negative curvature parameters of graphs
Fast approximation of eccentricities and distances in hyperbolic graphs
Fully dynamic consistent k-center clustering
scientific article; zbMATH DE number 4031953 (Why is no real title available?)
scientific article; zbMATH DE number 177842 (Why is no real title available?)
scientific article; zbMATH DE number 849252 (Why is no real title available?)
Isometric path complexity of graphs
Minimum eccentricity shortest path problem with respect to structural parameters
Minimum eccentricity shortest path problem: an approximation algorithm and relation with the k-laminarity problem
Minimum eccentricity shortest paths in some structured graph classes
On computing the hyperbolicity of real-world graphs
On graphs coverable by k shortest paths
On the computational complexity of centers locating in a graph
On the minimum eccentricity shortest path problem
Optimal binary space partitions in the plane
Packing and Covering δ-Hyperbolic Spaces by Balls
Parameterized algorithms for eccentricity shortest path problem
Parameterizing path partitions
Scaled Gromov hyperbolic graphs
Separator theorem and algorithms for planar hyperbolic graphs
State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
The median procedure on median graphs
Tree-decompositions with bags of small diameter

This page was built for publication: Additive approximation algorithm for geodesic centers in $\delta$-hyperbolic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956049)