Pages that link to "Item:Q5241236"
From MaRDI portal
The following pages link to A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236):
Displaying 4 items.
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)
