The single maximum coverage location problem is as follows. We are given an edge-weighted tree with customers located at the nodes. Each node u is associated with a demand w(u) and a radius r(u). The goal is to find, for some facility, a node x such that the total demand of customers u whose distance to x is at most r(u) is maximized. We give a simple O(nlogn) algorithm for this problem which improves upon the previously fastest algorithms. We complement this result by an Ω(n log n) lower bound showing that our algorithm is optimal. We observe that our algorithm leads also to improved time bounds for several other location problems such as indirect covering subtree and certain competitive location problems. Finally, we outline how our algorithm can be extended to a large class of distance-based location problems. © 2010 Springer-Verlag.
CITATION STYLE
Spoerhase, J. (2010). An optimal algorithm for single maximum coverage location on trees and related problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6506 LNCS, pp. 440–450). https://doi.org/10.1007/978-3-642-17517-6_39
Mendeley helps you to discover research relevant for your work.