Pages that link to "Item:Q2848196"
From MaRDI portal
The following pages link to Robust approximation schemes for cube packing (Q2848196):
Displaying 18 items.
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- A robust APTAS for the classical bin packing problem (Q1013966) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Efficient 1-space bounded hypercube packing algorithm (Q2205633) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- (Q3538438) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- Lower bounds for several online variants of bin packing (Q5915655) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)