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

DOI10.1016/J.ORL.2003.11.011zbMATH Open1052.05064OpenAlexW2052433163MaRDI QIDQ703267FDOQ703267

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

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

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)

Cites Work

• Title not available (Why is that?)
• A Best Possible Heuristic for the k-Center Problem
• An Optimal Synchronizer for the Hypercube
• A simple heuristic for the p-centre problem
• A heuristic for the p-center problem in graphs
• Compact routing with minimum stretch
• (1 + εΒ) -spanner constructions for general graphs
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)