An approximation algorithm for the general max-min resource sharing problem

DOI10.1007/S10107-005-0669-1MaRDI QIDQ2492678zbMATH OpenOpenAlexFDO

Authors Klaus Jansen

Publication date 14 June 2006

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-005-0669-1

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47)

Recommendations

• Algorithm Theory - SWAT 2004
• Approximate max-min resource sharing for structured concave optimization
• Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
• Faster min-max resource sharing in theory and practice
• Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem

Cites work

• A fast approximation scheme for fractional covering problems with variable upper bounds
• A near-optimal solution to a two-dimensional cutting stock problem
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Approximate max-min resource sharing for structured concave optimization
• Coordination Complexity of Parallel Price-Directive Decomposition
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
• scientific article; zbMATH DE number 1342139 (Why is no real title available?)
• scientific article; zbMATH DE number 1086924 (Why is no real title available?)
• scientific article; zbMATH DE number 1507300 (Why is no real title available?)
• scientific article; zbMATH DE number 1754632 (Why is no real title available?)
• scientific article; zbMATH DE number 2086932 (Why is no real title available?)
• scientific article; zbMATH DE number 910872 (Why is no real title available?)
• Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem
• Potential function methods for approximately solving linear programming problems: theory and practice.
• Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme

Cited in

(11)

• Approximate max-min resource sharing for structured concave optimization
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
• Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
• Approximation Algorithms for Computing Maximin Share Allocations
• Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem
• Algorithm Theory - SWAT 2004
• Faster min-max resource sharing in theory and practice
• Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
• Resource allocation under limited sharing
• Faster and simpler approximation algorithms for mixed packing and covering problems
• Approximation algorithms for general packing problems and their application to the multicast congestion problem

This page was built for publication: An approximation algorithm for the general max-min resource sharing problem

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