Approximation algorithms for hierarchical location problems
From MaRDI portal
Publication:5920573
DOI10.1016/j.jcss.2005.09.004zbMath1095.68132OpenAlexW2055696239MaRDI QIDQ5920573
Publication date: 30 June 2006
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2005.09.004
Related Items
A 16-competitive algorithm for hierarchical median problem, General bounds for incremental maximization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal time bounds for approximate clustering
- Clustering to minimize the maximum intercluster distance
- Performance guarantees for hierarchical clustering
- A constant-factor approximation algorithm for the \(k\)-median problem
- A new greedy approach for facility location problems
- A Best Possible Heuristic for the k-Center Problem
- Greedy Strikes Back: Improved Facility Location Algorithms
- Incremental Clustering and Dynamic Information Retrieval
- The Online Median Problem
- Clustering to minimize the sum of cluster diameters
- Local search heuristic for k-median and facility location problems