Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
From MaRDI portal
Publication:6117321
DOI10.1007/s10878-024-01106-0OpenAlexW4392147293MaRDI QIDQ6117321
Publication date: 20 March 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-024-01106-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Approximation algorithms for geometric median problems
- An approximation algorithm for the fault tolerant metric facility location problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Submodular functions and optimization.
- LP-Based Algorithms for Capacitated Facility Location
- Approximation Algorithms for Metric Facility Location Problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Fault-tolerant facility location
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Robust \(k\)-center with two types of radii
This page was built for publication: Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
