An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems

DOI10.1007/978-3-642-17517-6_39zbMath1311.90065OpenAlexW1602739162MaRDI QIDQ3060754

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

zbMATH Keywords

treegraph algorithmefficient algorithmcoverage

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Improved algorithms for some competitive location centroid problems on paths, trees and graphs

This page was built for publication: An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems