The weighted k-center problem in trees for fixed k

Authors

Binay Bhattacharya, Simon Fraser University
Sandip Das, Indian Statistical Institute, Kolkata
Subhadeep Ranjan Dev, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Theoretical Computer Science

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(nlog⁡n) by Wang et al. (2018) [20]. Whether an O(n) time algorithm exists for arbitrary k is still open.

First Page

64

Last Page

75

DOI

10.1016/j.tcs.2022.01.005

Publication Date

3-5-2022

Comments

Open Access, Green

Recommended Citation

Bhattacharya, Binay; Das, Sandip; and Dev, Subhadeep Ranjan, "The weighted k-center problem in trees for fixed k" (2022). Journal Articles. 3207.
https://digitalcommons.isical.ac.in/journal-articles/3207