No. Title Author Year
1 Non-Uniform k-Center and Greedy Clustering Inamdar, Tanmay et al. 2022
2 Capacitated Sum-Of-Radii Clustering: An FPT Approximation Inamdar, Tanmay et al. 2020
3 A Constant Approximation for Colorful k-Center Bandyapadhyay, Sayan et al. 2019
4 Capacitated Covering Problems in Geometric Spaces Bandyapadhyay, Sayan et al. 2018
5 Improved Approximation Bounds for the Minimum Constraint Removal Problem Bandyapadhyay, Sayan et al. 2018
6 On Partial Covering For Geometric Set Systems Inamdar, Tanmay et al. 2018
7 Faster Algorithms for the Geometric Transportation Problem Agarwal, Pankaj K. et al. 2017
8 Approximate Clustering via Metric Partitioning Bandyapadhyay, Sayan et al. 2016
9 On Variants of k-means Clustering Bandyapadhyay, Sayan et al. 2016
10 On the Sensitivity of Shape Fitting Problems Varadarajan, Kasturi et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 10

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