An optimal algorithm for the continuous/discrete weighted 2-center problem in trees

Authors:
Boaz Ben-Moshe;Binay Bhattacharya;Qiaosheng Shi
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada
Venue:
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Year:
2006

Citing 1
Cited 2

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)

Optimal algorithms for the path/tree-shaped facility location problems in trees

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Optimal algorithms for the weighted p-center problems on the real line for small p

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method generalizes the “trimming” technique of Megiddo [5] in a nontrivial way. This result allows an improved O(n log n) time algorithm for the weighted 3-center and 4-center problems.