Pages that link to "Item:Q975519"
From MaRDI portal
The following pages link to Asymptotic fully polynomial approximation schemes for variants of open-end bin packing (Q975519):
Displaying 10 items.
- Online bin packing with overload cost (Q831684) (← links)
- Hardness of lazy packing and covering (Q1015303) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- On various open-end bin packing game (Q2149858) (← links)
- Open-end bin packing: new and old analysis approaches (Q2172402) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)
