An optimal algorithm for single maximum coverage location on trees and related problems
DOI10.1007/978-3-642-17517-6_39zbMATH Open1311.90065OpenAlexW1602739162MaRDI QIDQ3060754FDOQ3060754
Authors: Joachim Spoerhase 
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_39
Recommendations
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees
- Maximal covering tree problems
- An Optimal Algorithm for Weighted Minimax Flow Centers on Trees
- Efficient solution methods for covering tree problems
- scientific article; zbMATH DE number 961964
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Discrete location and assignment (90B80)
Cited In (5)
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees
- Optimal direct and indirect covering trees
- Title not available (Why is that?)
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- Maximal covering tree problems
This page was built for publication: An optimal algorithm for single maximum coverage location on trees and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060754)
