Improved approximation algorithms for constrained fault-tolerant resource allocation (extended abstract)

DOI10.1007/978-3-642-40164-0_23MaRDI QIDQ2842788zbMATH OpenOpenAlexFDO

Authors Kewen Liao, Hong Shen, Longkun Guo

Publication date 16 August 2013

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40164-0_23

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
• Unconstrained and constrained fault-tolerant resource allocation
• The fault-tolerant facility allocation problem
• Approximation algorithms for the fault-tolerant facility placement problem
• Approximation algorithms for fault tolerant facility allocation

Cited in

(6)

• Improved approximation algorithms for constrained fault-tolerant resource allocation
• Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
• Unconstrained and constrained fault-tolerant resource allocation
• New Approximation Results for Resource Replication Problems
• Approximation algorithm for resource allocation problems with time dependent penalties
• LP-rounding algorithms for the fault-tolerant facility placement problem

This page was built for publication: Improved approximation algorithms for constrained fault-tolerant resource allocation (extended abstract)

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