A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties

Authors:
Yu Li;Donglei Du;Naihua Xiu;Dachuan Xu
Affiliations:
Department of Mathematics, School of Science, Beijing Jiaotong University, 3 Shangyuancun, Haidian District, Beijing 100044, PR China;Faculty of Business Administration, University of New Brunswick, Fredericton, NB, Canada E3B 5A3;Department of Mathematics, School of Science, Beijing Jiaotong University, 3 Shangyuancun, Haidian District, Beijing 100044, PR China;Department of Applied Mathematics, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100124, PR China
Venue:
Theoretical Computer Science
Year:
2013

Citing 8
Cited 0

Greedy strikes back: improved facility location algorithms

Journal of Algorithms
Algorithms for facility location problems with outliers

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Improved Combinatorial Algorithms for Facility Location Problems

SIAM Journal on Computing
Network design for information networks

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A 1.488 approximation algorithm for the uncapacitated facility location problem

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Approximation algorithms for supply chain planning and logistics problems with market choice

Mathematical Programming: Series A and B

Quantified Score

Hi-index	5.23

Visualization

Abstract

We offer the currently best approximation ratio 2.375 for the facility location problem with submodular penalties (FLPSP), improving not only the previous best combinatorial ratio 3, but also the previous best non-combinatorial ratio 2.488. We achieve this improved ratio by combining the primal-dual scheme with the greedy augmentation technique.