Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem

DOI10.1007/11764298_19MaRDI QIDQ5307545zbMATH OpenOpenAlexFDO

Authors Mihhail Aizatulin, Florian Diedrich, Klaus Jansen

Publication date 14 September 2007

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11764298_19

zbMATH Keywords

algorithm engineeringevaluationfine-tuningimplementationmathematical programmingtesting

Mathematics Subject Classification ID

Approximation algorithms (68W25) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximation algorithm for the general max-min resource sharing problem
• Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
• Algorithm Theory - SWAT 2004
• Faster min-max resource sharing in theory and practice
• Approximate max-min resource sharing for structured concave optimization

Cited in

(6)

• An approximation algorithm for the general max-min resource sharing problem
• New Approximation Results for Resource Replication Problems
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
• Faster min-max resource sharing in theory and practice
• Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
• Faster and simpler approximation algorithms for mixed packing and covering problems

This page was built for publication: Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem

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