Asymmetric k-center with minimum coverage
From MaRDI portal
Publication:2380063
DOI10.1016/J.IPL.2007.08.006zbMATH Open1187.68706DBLPjournals/ipl/Gortz08OpenAlexW2119051275WikidataQ60554466 ScholiaQ60554466MaRDI QIDQ2380063FDOQ2380063
Authors: Inge Li Gørtz 
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
Recommendations
Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Discrete location and assignment (90B80)
Cites Work
- Algorithms for facility location problems with outliers. (Extended abstract)
- A Best Possible Heuristic for the k-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- \(k\)-center problems with minimum coverage
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Title not available (Why is that?)
- A heuristic for the p-center problem in graphs
- The \(p\)-neighbor \(k\)-center problem
- Easy and hard bottleneck location problems
- Facility location with dynamic distance functions
- Title not available (Why is that?)
- Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
- Asymmetry in \(k\)-center variants
Cited In (6)
This page was built for publication: Asymmetric \(k\)-center with minimum coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380063)
