The following pages link to Online multiple-strip packing (Q621841):
Displaying 9 items.
- A new lower bound for online strip packing (Q322552) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- The generalization of scheduling with machine cost (Q392182) (← links)
- New upper bounds for online strip packing (Q1751205) (← links)
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← links)
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling (Q2898033) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing (Q3297564) (← links)
- (Q5002616) (← links)
