New Approximation Results for Resource Replication Problems

DOI10.1007/978-3-642-32512-0_19MaRDI QIDQ3167398zbMATH OpenOpenAlexFDO

Authors Samir Khuller, Barna Saha, Kanthi K. Sarpatwar

Publication date 2 November 2012

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• New approximation results for resource replication problems
• A new approximation technique for resource-allocation problems
• scientific article; zbMATH DE number 2086936
• An improved approximation algorithm for \textsc{Resource Allocation}
• New results on the complexity of the Max- and Min-Rep problems
• Improved approximation algorithms for constrained fault-tolerant resource allocation (extended abstract)
• Improved approximation algorithms for constrained fault-tolerant resource allocation
• Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem
• Algorithm Theory - SWAT 2004
• Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications

Cited in

(2)

• New approximation results for resource replication problems
• Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems

This page was built for publication: New Approximation Results for Resource Replication Problems

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