An Improved Algorithm for Online Rectangle Filling

DOI10.1007/978-3-642-18318-8_22MaRDI QIDQ3075466zbMATH OpenOpenAlexFDO

Authors Rob van Stee

Publication date 15 February 2011

Published in Approximation and Online Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An improved algorithm for online rectangle filling
• New algorithms for online rectangle filling with k-lookahead
• New Algorithms for Online Rectangle Filling with k-Lookahead
• Online rectangle filling
• Online Rectangle Filling
• A lower bound for online rectangle packing
• On-line algorithms for packing rectangles into several strips
• scientific article; zbMATH DE number 1982176
• Improved bound for online square-into-square packing

Cited in

(2)

• An improved algorithm for online rectangle filling
• Scheduling resource allocation with timeslot penalty for changeover

This page was built for publication: An Improved Algorithm for Online Rectangle Filling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075466)