Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs

DOI10.1007/s00453-018-0425-6zbMath1397.05189arXiv1604.07359OpenAlexW2790623224MaRDI QIDQ1799228

Katherine Edwards, Iraj Saniee, W. Sean Kennedy

Publication date: 18 October 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.07359

zbMATH Keywords

clusteringdelta-hyperbolicity\(p\)-centers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Fast approximation and exact computation of negative curvature parameters of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple heuristic for the p-centre problem
• The discrete p-dispersion problem
• Easy and hard bottleneck location problems
• A comparison of \(p\)-dispersion heuristics
• Comparison Of Four Models For dispersing Facilities
• Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
• Packing and Covering δ-Hyperbolic Spaces by Balls
• A Best Possible Heuristic for the k-Center Problem
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Efficient Algorithms for Shortest Paths in Sparse Networks