An approximation algorithm for the edge-dilation \(k\)-center problem.

DOI10.1016/j.orl.2003.11.011zbMath1052.05064OpenAlexW2052433163MaRDI QIDQ703267

Yanjun Li, Ojas Parekh, Amitabh Sinha, Jochen Könemann

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.11.011

zbMATH Keywords

distancecommunication networkscenters

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items

Analysis of farthest point sampling for approximating geodesics in a graph

Cites Work

• Unnamed Item
• Unnamed Item
• A simple heuristic for the p-centre problem
• A heuristic for the p-center problem in graphs
• Compact Routing with Minimum Stretch
• A Best Possible Heuristic for the k-Center Problem
• An Optimal Synchronizer for the Hypercube
• (1 + εΒ) -spanner constructions for general graphs