An approximation algorithm for the fault tolerant metric facility location problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1670540
- Fault-tolerant facility location
- A distributed approximation algorithm for fault-tolerant metric facility location
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Improved algorithms for fault tolerant facility location
Cited in
(17)- The fault-tolerant facility allocation problem
- Approximation algorithms for the fault-tolerant facility placement problem
- scientific article; zbMATH DE number 1670540 (Why is no real title available?)
- Fault-tolerant concave facility location problem with uniform requirements
- A note on the extension complexity of the knapsack polytope
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- Beyond Moulin mechanisms
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- Constant approximation for fault-tolerant median problems via iterative rounding
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
- Maximum gradient embeddings and monotone clustering
- Maximum subset intersection
- The approximation gap for the metric facility location problem is not yet closed
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- LP-rounding algorithms for the fault-tolerant facility placement problem
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
- A distributed approximation algorithm for fault-tolerant metric facility location
This page was built for publication: An approximation algorithm for the fault tolerant metric facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879244)