A computational study of approximation algorithms for a minmax resource allocation problem
From MaRDI portal
Publication:5262858
zbMATH Open1316.91018MaRDI QIDQ5262858FDOQ5262858
Authors: Bogusz Przybyslawski, Adam Kasperski 
Publication date: 16 July 2015
Recommendations
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- scientific article; zbMATH DE number 4149886
- Approximating the min-max (regret) selecting items problem
- An improved approximation algorithm for \textsc{Resource Allocation}
- Improved algorithm for resource allocation problems
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Semidefinite programming (90C22)
Cited In (11)
- Title not available (Why is that?)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Faster min-max resource sharing in theory and practice
- A Max-Min Allocation Problem: Its Solutions and Applications
- Title not available (Why is that?)
- Optimal resource allocation with minimum activation levels and fixed costs
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
- Technical Note—On Min-Max Integer Allocation Problems
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
- An approximate solution to the linear problem of minimizing resource consumption
- Approximation algorithms for constrained resource allocation
This page was built for publication: A computational study of approximation algorithms for a minmax resource allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262858)
