Approximation algorithms for the fault-tolerant facility location problem with submodular penalties

This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that t j distinct facilities serve it. This is the first constant performance guarantee known for this...

Full description

Saved in:
Bibliographic Details
Published inJournal of combinatorial optimization Vol. 47; no. 2
Main Authors Guo, Yingying, Li, Qiaoliang
Format Journal Article
LanguageEnglish
Published New York Springer US 01.03.2024
Springer Nature B.V
Subjects
Algorithms
Approximation
Combinatorics
Convex and Discrete Geometry
Fault tolerance
Mathematical analysis
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations research
Operations Research/Decision Theory
Optimization
Rounding
Site selection
Theory of Computation
90C10
Submodular penalty
90C27
Facility location problem
Approximation algorithm
Fault-tolerant
Online AccessGet full text

Cover

More Information
Summary:This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that t j distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same.
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-024-01106-0