Binay Bhattacharya, Sandip Das 0001, Subhadeep Ranjan Dev. The Weighted k-Center Problem in Trees for Fixed k. In Pinyan Lu, Guochuan Zhang, editors, 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China. Volume 149 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]
@inproceedings{Bhattacharya0D19,
title = {The Weighted k-Center Problem in Trees for Fixed k},
author = {Binay Bhattacharya and Sandip Das 0001 and Subhadeep Ranjan Dev},
year = {2019},
doi = {10.4230/LIPIcs.ISAAC.2019.27},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.27},
researchr = {https://researchr.org/publication/Bhattacharya0D19},
cites = {0},
citedby = {0},
booktitle = {30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China},
editor = {Pinyan Lu and Guochuan Zhang},
volume = {149},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-130-6},
}