TY - GEN

T1 - Constant factor approximation algorithm for uniform hard capacitated knapsack median problem

AU - Grover, Sapna

AU - Gupta, Neelima

AU - Khuller, Samir

AU - Pancholi, Aditya

PY - 2018/12

Y1 - 2018/12

N2 - 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 + ∊ and capacities by a 2 + ∊ 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/∊2) factor approximation for the problem, violating capacities by (2+∊). Another result is an O(1/∊) factor approximation, violating the capacities by a factor of at most (1+∊) using at most 2k facilities for a fixed ∊ > 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 + ∊) 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.

AB - 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 + ∊ and capacities by a 2 + ∊ 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/∊2) factor approximation for the problem, violating capacities by (2+∊). Another result is an O(1/∊) factor approximation, violating the capacities by a factor of at most (1+∊) using at most 2k facilities for a fixed ∊ > 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 + ∊) 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.

KW - Capacitated k-facility location

KW - Capacitated knapsack median

UR - http://www.scopus.com/inward/record.url?scp=85079486787&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85079486787&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.FSTTCS.2018.23

DO - 10.4230/LIPIcs.FSTTCS.2018.23

M3 - Conference contribution

AN - SCOPUS:85079486787

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018

A2 - Ganguly, Sumit

A2 - Pandya, Paritosh

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018

Y2 - 11 December 2018 through 13 December 2018

ER -