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

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.

Authors

• Yu Li International Digital Economy Academy (IDEA)
• Donglei Du
• Naihua Xiu
• Dachuan Xu Beijing University of Technology, Beijing, China

Keywords

• Approximation algorithm
• Facility location problem
• Linear programming
• Submodular function