A note on the Kenyon-Remila strip-packing algorithm
type: Item
instance of: scholarly article
title: A note on the Kenyon-Remila strip-packing algorithm
zbMATH Open document ID: 1233.68141
published in: Information Processing Letters
publication date: 2012-03-09T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6013677
zbMATH Keywords: bin packing
zbMATH Keywords: approximation algorithms
zbMATH Keywords: strip packing
author: Maxim Sviridenko
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.10.003
OpenAlex ID: W2071605324
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: New Approximability Results for 2-Dimensional Packing Problems
cites work: A near-optimal solution to a two-dimensional cutting stock problem
DOI: 10.1016/J.IPL.2011.10.003
description: scientific article; zbMATH DE number 6013677