Scheduling Resources for Throughput Maximization
From MaRDI portal
Publication:3088087
DOI10.1007/978-3-642-22935-0_10zbMath1343.90032OpenAlexW1828566370MaRDI QIDQ3088087
Sambuddha Roy, Venkatesan T. Chakaravarthy, Yogish Sabharwal, Amit Kumar, Vinayaka Pandit
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_10
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the unsplittable flow problem
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Scheduling with limited machine availability
- A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints
- Linear degree extractors and the inapproximability of max clique and chromatic number
- A quasi-PTAS for unsplittable flow on line graphs
- Multicommodity demand flow in a tree and packing integer programs
- A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
- A unified approach to approximating resource allocation and scheduling
