Approximation algorithms for edge-dilation k-center problems

DOI10.1007/3-540-45471-3_22MaRDI QIDQ3046493zbMATH OpenFDO

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

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2368/23680210.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• An approximation algorithm for the edge-dilation \(k\)-center problem.
• Approximation algorithms for the k-center problem: an experimental evaluation
• An approximation algorithm for k-center problem on a convex polygon
• Approximation algorithms for a \(k\)-line center
• Approximation algorithms for k-line center
• Approximating k-center in planar graphs
• On approximation algorithm for the edge metric dimension problem
• Approximation algorithms for the star k-hub center problem in metric graphs
• Approximation algorithms for diversity-bounded center problems
• Approximation Algorithms for Edge-Covering Problem

Cited in

(6)

• On approximation algorithm for the edge metric dimension problem
• Approximation algorithms for selecting network centers
• Analysis of farthest point sampling for approximating geodesics in a graph
• An approximation algorithm for the edge-dilation \(k\)-center problem.
• Approximation algorithms for a \(k\)-line center
• New algorithms for \(k\)-center and extensions

This page was built for publication: Approximation algorithms for edge-dilation \(k\)-center problems

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