@inproceedings{eeadc5a7a34446eaa0a918f10def65a9,
title = "An optimal algorithm for the continuous/discrete weighted 2-center problem in trees",
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.",
author = "Boaz Ben-Moshe and Binay Bhattacharya and Qiaosheng Shi",
year = "2006",
doi = "10.1007/11682462\_19",
language = "אנגלית",
isbn = "354032755X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "166--177",
booktitle = "LATIN 2006",
note = "LATIN 2006: Theoretical Informatics - 7th Latin American Symposium ; Conference date: 20-03-2006 Through 24-03-2006",
}