Pages that link to "Item:Q5491240"
From MaRDI portal
The following pages link to Approximate algorithms to pack rectangles into several strips (Q5491240):
Displayed 14 items.
- A new lower bound for online strip packing (Q322552) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- Improved approximation algorithms for scheduling parallel jobs on identical clusters (Q496005) (← links)
- Scheduling parallel jobs on heterogeneous platforms (Q510901) (← links)
- Numerical optimization method for packing regular convex polygons (Q519665) (← links)
- Online multiple-strip packing (Q621841) (← 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)
- APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS (Q2905284) (← 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)
- On-line algorithms for packing rectangles into several strips (Q5439071) (← links)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)