The following pages link to (Q4133108):
Displaying 23 items.
- Tight bounds for online class-constrained packing (Q596145) (← links)
- An approximation algorithm for square packing. (Q703277) (← links)
- Random-order bin packing (Q948706) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- Scheduling jobs on grid processors (Q973018) (← links)
- Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← links)
- Approximation algorithms for combinatorial problems (Q1213733) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- Parametric on-line algorithms for packing rectangles and boxes. (Q1405228) (← links)
- Bin packing under linear constraints (Q1679514) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- Fast algorithms for bin packing (Q1845315) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- The tight absolute bound of First Fit in the parameterized case (Q2355708) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Online bin packing with resource augmentation (Q2427692) (← links)
- Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- On the generalized bin packing problem (Q5278218) (← links)
