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