No. Title Author Year
1 Non-Uniform k-Center and Greedy Clustering Inamdar, Tanmay et al. 2022
2 ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space Fomin, Fedor V. et al. 2021
3 Capacitated Sum-Of-Radii Clustering: An FPT Approximation Inamdar, Tanmay et al. 2020
4 A Constant Approximation for Colorful k-Center Bandyapadhyay, Sayan et al. 2019
5 Capacitated Covering Problems in Geometric Spaces Bandyapadhyay, Sayan et al. 2018
6 Large-Scale Distributed Algorithms for Facility Location with Outliers Inamdar, Tanmay et al. 2018
7 On Partial Covering For Geometric Set Systems Inamdar, Tanmay et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 7


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI