A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties

Authors:
Yu Li;Donglei Du;Naihua Xiu;Dachuan Xu
Affiliations:
Department of Mathematics, School of Science, Beijing Jiaotong University, Beijing, P.R. China 100044;Faculty of Business Administration, University of New Brunswick, Fredericton, Canada E3B 5A3;Department of Mathematics, School of Science, Beijing Jiaotong University, Beijing, P.R. China 100044;Department of Applied Mathematics, Beijing University of Technology, Beijing, P.R. China 100124
Venue:
Journal of Combinatorial Optimization
Year:
2014

Citing 12
Cited 0

Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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)
Quick and good facility location

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Network design for information networks

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Metric Facility Location Problems

SIAM Journal on Computing
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
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties

Information Processing Letters
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
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study two variants of the classical facility location problem, namely, the facility location problem with linear penalties (FLPLP) and the facility location problem with submodular penalties (FLPSP), respectively. We give a unified dual-fitting based approximation algorithm for these two problems, yielding approximation ratios 2 and 3 respectively.