Pages that link to "Item:Q880529"
From MaRDI portal
The following pages link to Approximation algorithms for extensible bin packing (Q880529):
Displaying 18 items.
- A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Online bin packing with overload cost (Q831684) (← links)
- Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
- Maximizing data locality in distributed systems (Q856409) (← links)
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Linear time-approximation algorithms for bin packing (Q1591548) (← links)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
- Approximation algorithms for extensible bin packing (Q2768352) (← links)
- Sum-of-squares heuristics for bin packing and memory allocation (Q3507786) (← links)
- (Q3787789) (← links)
- Improved Approximation for Vector Bin Packing (Q4575690) (← links)
- Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers (Q5131692) (← links)
- Approximation and Online Algorithms (Q5896936) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items (Q6090896) (← links)