A (5/3 + ε)-Approximation for Strip Packing

DOI10.1007/978-3-642-22300-6_40zbMath1342.68357OpenAlexW61631658MaRDI QIDQ5199266

Rolf Harren, Lars Prädel, Rob van Stee, Klaus Jansen

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://edoc.mpg.de/618695

zbMATH Keywords

approximation algorithmstrip packingrectangle packingabsolute worst-case ratio

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (6)

Packing anchored rectangles ⋮ Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ Polynomial-time approximation schemes for circle and other packing problems ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks

This page was built for publication: A (5/3 + ε)-Approximation for Strip Packing