License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2018.23
URN: urn:nbn:de:0030-drops-99224
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9922/
Grover, Sapna ;
Gupta, Neelima ;
Khuller, Samir ;
Pancholi, Aditya
Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem
Abstract
In this paper, we give the first constant factor approximation algorithm for capacitated knapsack median problem (CKnM) for hard uniform capacities, violating the budget by a factor of 1+epsilon and capacities by a 2+epsilon factor. To the best of our knowledge, no constant factor approximation is known for the problem even with capacity/budget/both violations. Even for the uncapacitated variant of the problem, the natural LP is known to have an unbounded integrality gap even after adding the covering inequalities to strengthen the LP. Our techniques for CKnM provide two types of results for the capacitated k-facility location problem. We present an O(1/epsilon^2) factor approximation for the problem, violating capacities by (2+epsilon). Another result is an O(1/epsilon) factor approximation, violating the capacities by a factor of at most (1 + epsilon) using at most 2k facilities for a fixed epsilon>0. As a by-product, a constant factor approximation algorithm for capacitated facility location problem with uniform capacities is presented, violating the capacities by (1 + epsilon) factor. Though constant factor results are known for the problem without violating the capacities, the result is interesting as it is obtained by rounding the solution to the natural LP, which is known to have an unbounded integrality gap without violating the capacities. Thus, we achieve the best possible from the natural LP for the problem. The result shows that the natural LP is not too bad.
BibTeX - Entry
@InProceedings{grover_et_al:LIPIcs:2018:9922,
author = {Sapna Grover and Neelima Gupta and Samir Khuller and Aditya Pancholi},
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 = {Sumit Ganguly and Paritosh Pandya},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9922},
URN = {urn:nbn:de:0030-drops-99224},
doi = {10.4230/LIPIcs.FSTTCS.2018.23},
annote = {Keywords: Capacitated Knapsack Median, Capacitated k -Facility Location}
}
|
Keywords: |
|
Capacitated Knapsack Median, Capacitated k -Facility Location |
|
Collection: |
|
38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
05.12.2018 |
