Approximation algorithms for hierarchical location problems

DOI10.1145/780542.780549MaRDI QIDQ5901083zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Approximation algorithms for hierarchical location problems
• An approximation algorithm for the hierarchical median problem
• A general approach for incremental approximation and hierarchical clustering
• On hierarchical diameter-clustering and the supplier problem
• On Hierarchical Diameter-Clustering, and the Supplier Problem

Cited in

(13)

• Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
• The reverse greedy algorithm for the metric k-median problem
• Performance guarantees for hierarchical clustering
• Incremental algorithms for facility location and \(k\)-median
• Clairvoyant mechanisms for online auctions
• Circular and radial design comparison of survivability in asymmetrical hierarchical networks
• An approximation algorithm for the hierarchical median problem
• Incremental flow
• A general approach for incremental approximation and hierarchical clustering
• On Hierarchical Diameter-Clustering, and the Supplier Problem
• Approximation algorithms for hierarchical location problems
• On hierarchical diameter-clustering and the supplier problem
• An incremental version of the \(k\)-center problem on boundary of a convex polygon

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901083)