License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2019.27
URN: urn:nbn:de:0030-drops-115238
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11523/
Bhattacharya, Binay ;
Das, Sandip ;
Dev, Subhadeep Ranjan
The Weighted k-Center Problem in Trees for Fixed k
Abstract
We present a linear time algorithm for the weighted k-center problem on trees for fixed k. This partially settles the long-standing question about the lower bound on the time complexity of the problem. The current time complexity of the best-known algorithm for the problem with k as part of the input is O(n log n) by Wang et al. [Haitao Wang and Jingru Zhang, 2018]. Whether an O(n) time algorithm exists for arbitrary k is still open.
BibTeX - Entry
@InProceedings{bhattacharya_et_al:LIPIcs:2019:11523,
author = {Binay Bhattacharya and Sandip Das and Subhadeep Ranjan Dev},
title = {{The Weighted k-Center Problem in Trees for Fixed k}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {27:1--27:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Pinyan Lu and Guochuan Zhang},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11523},
URN = {urn:nbn:de:0030-drops-115238},
doi = {10.4230/LIPIcs.ISAAC.2019.27},
annote = {Keywords: facility location, prune and search, parametric search, k-center problem, conditional k-center problem, trees}
}
|
Keywords: |
|
facility location, prune and search, parametric search, k-center problem, conditional k-center problem, trees |
|
Collection: |
|
30th International Symposium on Algorithms and Computation (ISAAC 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
28.11.2019 |
