Pages that link to "Item:Q2379919"
From MaRDI portal
The following pages link to Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919):
Displaying 8 items.
- Hardness of lazy packing and covering (Q1015303) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Online lazy bureaucrat scheduling with a machine deadline (Q1702835) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Open-end bin packing: new and old analysis approaches (Q2172402) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis (Q3591341) (← links)