A lower bound for online rectangle packing

From MaRDI portal
Publication:2331592

DOI10.1007/s10878-019-00423-zzbMath1431.90130arXiv1811.09573OpenAlexW2962913470WikidataQ127824340 ScholiaQ127824340MaRDI QIDQ2331592

Leah Epstein

Publication date: 29 October 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.09573




Related Items (5)




Cites Work




This page was built for publication: A lower bound for online rectangle packing