An approximation algorithm for the general max-min resource sharing problem
From MaRDI portal
Recommendations
- Approximation algorithms for the general max-min resource sharing problem: Faster and simpler
- 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 Lagrangian decomposition with a modified Karmarkar logarithmic potential
- Approximate max-min resource sharing for structured concave optimization
- Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs
- 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
- Fractional path coloring with applications to WDM networks
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem
- On preemptive resource constrained scheduling: Polynomial-time approximation schemes
- On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms
- 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
- Approximation algorithms for the general max-min resource sharing problem: Faster and simpler
- 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)