Approximation algorithms for fault tolerant facility allocation
From MaRDI portal
Publication:2870525
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Factorization of matrices (15A23) Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Discrete location and assignment (90B80)
Recommendations
- The fault-tolerant facility allocation problem
- Improved approximation algorithm for fault-tolerant facility placement
- LP-rounding algorithms for the fault-tolerant facility placement problem
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract)
Cited in
(7)- The fault-tolerant facility allocation problem
- Unconstrained and constrained fault-tolerant resource allocation
- Improved approximation algorithms for constrained fault-tolerant resource allocation (extended abstract)
- Improved approximation algorithm for fault-tolerant facility placement
- Improved approximation algorithms for constrained fault-tolerant resource allocation
- Fault-tolerant total domination via submodular function approximation
- Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
This page was built for publication: Approximation algorithms for fault tolerant facility allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870525)