Pages that link to "Item:Q763478"
From MaRDI portal
The following pages link to A note on the Kenyon-Remila strip-packing algorithm (Q763478):
Displayed 4 items.
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- (Q5075807) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)