Pages that link to "Item:Q5167778"
From MaRDI portal
The following pages link to How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions (Q5167778):
Displaying 6 items.
- The TV advertisements scheduling problem (Q1733325) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
- (Q5091246) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558) (← links)
