An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1,Xp)-medianoid problem on trees

Authors:
J. Spoerhase;H. -C. Wirth
Affiliations:
Lehrstuhl für Informatik 1, Am Hubland, 97074 Würzburg, Germany;Lehrstuhl für Informatik 1, Am Hubland, 97074 Würzburg, Germany
Venue:
Information Processing Letters
Year:
2009

Citing 2
Cited 1

The budgeted maximum coverage problem

Information Processing Letters
Budgeted Maximum Graph Coverage

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

(r,p)-centroid problems on paths and trees

Theoretical Computer Science

Quantified Score

Hi-index	0.90

Visualization

Abstract

The single maximum coverage location problem on a tree consists of placing one facility onto a node such that the total weight of users covered by the facility is maximized. Users are located at nodes of the tree. Each user has an individual sensitivity radius and is covered if and only if the facility is placed within that radius. This problem is a generalization of the (1,X"p)-medianoid problem (Hakimi, 1990). We provide a recursive graph coarsening algorithm which improves the running time from O(n^2) (Megiddo, 1983) to O(n(logn)^2/loglogn).