Pages that link to "Item:Q5346558"
From MaRDI portal
The following pages link to A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558):
Displaying 13 items.
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
- Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← 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)
- Robust Appointment Scheduling with Heterogeneous Costs (Q5875477) (← links)
