LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
From MaRDI portal
Publication:2295313
Recommendations
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
- LP-rounding algorithms for the fault-tolerant facility placement problem
- LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract)
- A primal-dual approximation algorithm for stochastic fault-tolerant facility location problems
- An approximation algorithm for the stochastic fault-tolerant facility placement problem
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- An approximation algorithm for the fault tolerant metric facility location problem
- scientific article; zbMATH DE number 1670540
Cites work
- scientific article; zbMATH DE number 6381764 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- scientific article; zbMATH DE number 5064928 (Why is no real title available?)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- A new approximation algorithm for the \(k\)-facility location problem
- An approximation algorithm for the fault tolerant metric facility location problem
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- An improved per-scenario bound for the two-stage stochastic facility location problem
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
- Greedy Strikes Back: Improved Facility Location Algorithms
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
Cited in
(8)- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
- An improved per-scenario bound for the two-stage stochastic facility location problem
- Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
- An approximation algorithm for the two-stage distributionally robust facility location problem
- A primal-dual approximation algorithm for stochastic fault-tolerant facility location problems
- Approximation algorithms for the fault-tolerant facility location problem with penalties
This page was built for publication: LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2295313)
