A simple greedy approximation algorithm for the minimum connected $$k$$ k -Center problem
Crossref DOI link: https://doi.org/10.1007/s10878-015-9831-8
Published Online: 2015-02-03
Published Print: 2016-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Liang, Dongyue
Mei, Liquan
Willson, James
Wang, Wei
Text and Data Mining valid from 2015-02-03