A note on the Kenyon-Remila strip-packing algorithm

DOI10.1016/j.ipl.2011.10.003zbMath1233.68141OpenAlexW2071605324MaRDI QIDQ763478

M. I. Sviridenko

Publication date: 9 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.003

zbMATH Keywords

approximation algorithmsbin packingstrip packing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (5)

A faster FPTAS for the unbounded knapsack problem ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ Complexity and inapproximability results for parallel task scheduling and strip packing ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing ⋮ Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times

Cites Work

• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• New Approximability Results for 2-Dimensional Packing Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

This page was built for publication: A note on the Kenyon-Remila strip-packing algorithm