Asymmetry in \(k\)-center variants
From MaRDI portal
Publication:2503348
DOI10.1016/j.tcs.2006.05.009zbMath1097.68149OpenAlexW2132106556MaRDI QIDQ2503348
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.009
Related Items (3)
Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ Client assignment problems for latency minimization ⋮ The weighted \(k\)-center problem in trees for fixed \(k\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(p\)-neighbor \(k\)-center problem
- A heuristic for the p-center problem in graphs
- Facility location with dynamic distance functions
- Fault tolerant \(K\)-center problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- 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
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Local search heuristic for k-median and facility location problems
This page was built for publication: Asymmetry in \(k\)-center variants