Pages that link to "Item:Q2816297"
From MaRDI portal
The following pages link to Better Bin Packing Approximations via Discrepancy Theory (Q2816297):
Displaying 7 items.
- Linear discrepancy is \(\Pi_2\)-hard to approximate (Q2234789) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- (Q5009562) (← links)
- Online bin packing of squares and cubes (Q5896890) (← links)
- Online bin packing of squares and cubes (Q5925713) (← links)
- Discrepancy theory and related algorithms (Q6200209) (← links)
- Time-sharing scheduling with tolerance capacities (Q6655677) (← links)
