How unsplittable-flow-covering helps scheduling with job-dependent cost functions
From MaRDI portal
Publication:1751090
DOI10.1007/s00453-017-0300-xzbMath1390.90314arXiv1403.1376OpenAlexW2595876204WikidataQ59521178 ScholiaQ59521178MaRDI QIDQ1751090
Andreas Wiese, Julián Mestre, Wiebke Höhn
Publication date: 23 May 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.1376
Related Items (3)
On improved interval cover mechanisms for crowdsourcing markets ⋮ Fixed-parameter algorithms for unsplittable flow cover ⋮ Optimal algorithms for scheduling under time-of-use tariffs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Matching theory
- An approximation algorithm for the generalized assignment problem
- A quasi-PTAS for unsplittable flow on line graphs
- Resource Allocation for Covering Time Varying Demands
- Approximation schemes for preemptive weighted flow time
- Multicommodity demand flow in a tree and packing integer programs
- Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
- On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
- The Geometry of Scheduling
- Algorithms for minimizing weighted flow time
- Dual Techniques for Scheduling on a Machine with Varying Speed
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
- A logarithmic approximation for unsplittable flow on line graphs
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: How unsplittable-flow-covering helps scheduling with job-dependent cost functions
