Unconstrained and constrained fault-tolerant resource allocation

DOI10.1007/978-3-642-22685-4_48MaRDI QIDQ3087982zbMATH OpenOpenAlexFDO

Authors Kewen Liao, Hong Shen

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_48

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Improved approximation algorithms for constrained fault-tolerant resource allocation (extended abstract)
• Improved approximation algorithms for constrained fault-tolerant resource allocation
• The fault-tolerant facility allocation problem
• Approximation algorithms for fault tolerant facility allocation
• Fault-tolerant concave facility location problem with uniform requirements

Cited in

(5)

• Minimum congestion redundant assignments to tolerate random faults
• Improved approximation algorithms for constrained fault-tolerant resource allocation
• Improved approximation algorithms for constrained fault-tolerant resource allocation (extended abstract)
• The fault-tolerant facility allocation problem
• LP-rounding algorithms for the fault-tolerant facility placement problem

This page was built for publication: Unconstrained and constrained fault-tolerant resource allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087982)