Asymmetric \(k\)-center with minimum coverage
From MaRDI portal
Publication:2380063
DOI10.1016/j.ipl.2007.08.006zbMath1187.68706OpenAlexW2119051275WikidataQ60554466 ScholiaQ60554466MaRDI QIDQ2380063
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.006
Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(p\)-neighbor \(k\)-center problem
- A heuristic for the p-center problem in graphs
- Easy and hard bottleneck location problems
- Facility location with dynamic distance functions
- \(k\)-center problems with minimum coverage
- Asymmetric k-center is log * n -hard to approximate
- A Best Possible Heuristic for the k-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques