Approximation algorithms for hierarchical location problems

DOI10.1145/780542.780549zbMath1192.68915OpenAlexW2144963887MaRDI QIDQ5901083

C. Greg Plaxton

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780549

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (7)

Circular and radial design comparison of survivability in asymmetrical hierarchical networks ⋮ An incremental version of the \(k\)-center problem on boundary of a convex polygon ⋮ Incremental flow ⋮ Performance guarantees for hierarchical clustering ⋮ Incremental algorithms for facility location and \(k\)-median ⋮ Clairvoyant Mechanisms for Online Auctions ⋮ The reverse greedy algorithm for the metric k-median problem

This page was built for publication: Approximation algorithms for hierarchical location problems