Faster algorithms for k-medians in trees: (Extended abstract)
Document Type
Article
Publication Date
1-1-2003
Abstract
In the k-median problem we are given a connected graph with non-negative weights associated with the nodes and lengths associated with the edges. The task is to compute locations of k facilities in order to minimize the sum of the weighted distances between each node and its closest facility. In this paper we consider the case when the graph is a tree. We show that this problem can be solved in time O(npolylog(n)) for the following cases: (i) directed trees (and any fixed k), (ii) balanced undirected trees, and (iii) undirected trees with k = 3. © Springer-Verlag Berlin Heidelberg 2003.
Identifier
35248857475 (Scopus)
ISBN
[9783540406716]
Publication Title
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
External Full Text Location
https://doi.org/10.1007/978-3-540-45138-9_16
e-ISSN
16113349
ISSN
03029743
First Page
218
Last Page
227
Volume
2747
Recommended Citation
Benkoczi, Robert; Bhattacharya, Binay; Chrobak, Marek; Larmore, Lawrence L.; and Rytter, Wojciech, "Faster algorithms for k-medians in trees: (Extended abstract)" (2003). Faculty Publications. 14473.
https://digitalcommons.njit.edu/fac_pubs/14473
