Fetching the paper…
Reading the bibliography…
Clustering is a fundamental tool in data mining.
Easy and hard bottleneck location problems
Wen-Lian Hsu and George L. Nemhauser · 1979
Earlier work this paper cites.
Clustering to minimize the maximum intercluster distance
Teofilo F. Gonzalez · 1985
Earlier work this paper cites.
A unified approach to approximation algorithms for bottleneck problems
Dorit S. Hochbaum and David B. Shmoys · 1986
Earlier work this paper cites.
How to allocate network centers
Judit Bar-Ilan, Guy Kortsarz, and David Peleg · 1993
Earlier work this paper cites.
Greedy strikes back: Improved facility location algorithms
Sudipto Guha and Samir Khuller · 1998
Earlier work this paper cites.
The capacitated k k -center problem
Samir Khuller and Yoram J. Sussmann · 2000
Earlier work this paper cites.
Algorithms for facility location problems with outliers
Moses Charikar, Samir Khuller, David M. Mount, and Giri Narasimhan · 2001
Earlier work this paper cites.
A new greedy approach for facility location problems
Kamal Jain, Mohammad Mahdian, and Amin Saberi · 2002
Earlier work this paper cites.
A constant factor approximation algorithm for k k -median clustering with outliers
Ke Chen · 2008
Earlier work this paper cites.
Achieving anonymity via clustering
Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, and An Zhu · 2010
Earlier work this paper cites.
Clustering with diversity
Jian Li, Ke Yi, and Qin Zhang · 2010
Earlier work this paper cites.
Lower-bounded facility location
Zoya Svitkina · 2010
Earlier work this paper cites.
Handling Conditional Discrimination
Indrė Z̆liobaitė, Faisal Kamiran, and Toon Calders · 2011
Earlier work this paper cites.
Improved approximation guarantees for lower-bounded facility location
Sara Ahmadian and Chaitanya Swamy · 2012
Cited alongside, same era.
A 5-approximation for capacitated facility location
Manisha Bansal, Naveen Garg, and Neelima Gupta · 2012
Cited alongside, same era.
LP rounding for k k -centers with non-uniform hard capacities
Marek Cygan, MohammadTaghi Hajiaghayi, and Samir Khuller · 2012
Cited alongside, same era.
Fairness through awareness
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard S. Zemel · 2012
Cited alongside, same era.
A 1.488 approximation algorithm for the uncapacitated facility location problem
Shi Li · 2012
Cited alongside, same era.
A 3-approximation algorithm for the facility location problem with uniform capacities
Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, and Surabhi Jain · 2013
Approximation algorithms for clustering problems with lower bounds and outliers
Sara Ahmadian and Chaitanya Swamy · 2016
Later among the works it cites.
Equality of opportunity in supervised learning
Moritz Hardt, Eric Price, and Nati Srebro · 2016
Later among the works it cites.
Improved and simplified inapproximability for k k -means
Euiwoong Lee, Melanie Schmidt, and John Wright · 2016
Later among the works it cites.
Approximating capacitated k k -median with ( 1 + ϵ ) k (1+\epsilon)k open facilities
Shi Li · 2016
Later among the works it cites.
Approximating k k -median via pseudo-approximation
Shi Li and Ola Svensson · 2016
Later among the works it cites.
Better guarantees for k k -means and Euclidean k k -median by primal-dual algorithms
Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, and Justin Ward · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Learning fair representations
Rich Zemel, Yu Wu, Kevin Swersky, Toni Pitassi, and Cynthia Dwork · 2013
Cited alongside, same era.
Approximation algorithms for hard capacitated k k -facility location problems
Karen Aardal, Pieter L. van den Berg, Dion Gijswijt, and Shanfei Li · 2014
Cited alongside, same era.
Constant factor approximation for capacitated k k -center with outliers
Marek Cygan and Tomasz Kociumaka · 2014
Cited alongside, same era.
An improved approximation algorithm for the hard uniform capacitated k k -median problem
Shanfei Li · 2014
Cited alongside, same era.
A multidisciplinary survey on discrimination analysis
Andrea Romei and Salvatore Ruggieri · 2014
Cited alongside, same era.
The hardness of approximation of euclidean k k -means
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, and Ali Kemal Sinop · 2015
Cited alongside, same era.
Later among the works it cites.
LP-based algorithms for capacitated facility location
Hyung-Chan An, Mohit Singh, and Ola Svensson · 2017
Later among the works it cites.
An improved approximation for k k -median and positive correlation in budgeted optimization
Jarosław Byrka, Thomas Pensyl, Bartosz Rybicki, Aravind Srinivasan, and Khoa Trinh · 2017
Later among the works it cites.
Fair clustering through fairlets
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii · 2017
Later among the works it cites.
On uniform capacitated k k -median beyond the natural LP relaxation
Shi Li · 2017
Later among the works it cites.
Constant approximation for k-median and k-means with outliers via iterative rounding
Ravishankar Krishnaswamy, Shi Li, and Sai Sandeep · 2018
Closest in time.
Privacy Preserving Clustering with Constraints
Clemens Rösner and Melanie Schmidt · 2018
Closest in time.