@InProceedings{grover_et_al:LIPIcs.FSTTCS.2018.23,
author = {Grover, Sapna and Gupta, Neelima and Khuller, Samir and Pancholi, Aditya},
title = {{Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {23:1--23:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.23},
URN = {urn:nbn:de:0030-drops-99224},
doi = {10.4230/LIPIcs.FSTTCS.2018.23},
annote = {Keywords: Capacitated Knapsack Median, Capacitated k -Facility Location}
}