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

DOI10.1016/J.ORL.2003.11.011MaRDI QIDQ703267zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 2089224
• The p-neighbor k-center problem
• scientific article; zbMATH DE number 177560
• A Best Possible Heuristic for the k-Center Problem
• Approximating \(k\)-center in planar graphs

Cites work

• scientific article; zbMATH DE number 2089224 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• (1 + εΒ) -spanner constructions for general graphs
• A Best Possible Heuristic for the k-Center Problem
• A heuristic for the p-center problem in graphs
• A simple heuristic for the p-centre problem
• An Optimal Synchronizer for the Hypercube
• Compact routing with minimum stretch

Cited in

(3)

• scientific article; zbMATH DE number 177560 (Why is no real title available?)
• scientific article; zbMATH DE number 2089224 (Why is no real title available?)
• Analysis of farthest point sampling for approximating geodesics in a graph

This page was built for publication: An approximation algorithm for the edge-dilation \(k\)-center problem.

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