Improved algorithm for resource allocation problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- A constant factor approximation algorithm for unsplittable flow on paths
- A linear-time approximation algorithm for the weighted vertex cover problem
- A quasi-PTAS for the two-dimensional geometric knapsack problem
- A quasi-PTAS for unsplittable flow on line graphs
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Multicommodity demand flow in a tree and packing integer programs
- New approximation schemes for unsplittable flow on a path
- On column-restricted and priority covering integer programs
- Optimization problems in multiple-interval graphs
- Primal-Dual Schema for Capacitated Covering Problems
- Reducibility among combinatorial problems
- Resource allocation for covering time varying demands
Cited in
(11)- An efficient algorithm for the parametric resource allocation problem
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
- Resource allocation problem under single resource assignment
- Scheduling resources for executing a partial set of jobs
- scientific article; zbMATH DE number 4149886 (Why is no real title available?)
- On improved interval cover mechanisms for crowdsourcing markets
- A computational study of approximation algorithms for a minmax resource allocation problem
- scientific article; zbMATH DE number 2086936 (Why is no real title available?)
- Resource allocation with time intervals
- An improved approximation algorithm for \textsc{Resource Allocation}
- Approximation algorithms for constrained resource allocation
This page was built for publication: Improved algorithm for resource allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604919)