✦ LIBER ✦

New algorithms for online rectangle filling with

✍ Scribed by Haitao Wang; Amitabh Chaudhary; Danny Z. Chen

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 424 KB
Volume: 21
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-009-9246-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new algorithm for the largest empty re

A new algorithm for the largest empty rectangle problem

✍ M. Orlowski 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 421 KB

Preemptive online algorithms for schedul

Preemptive online algorithms for scheduling with machine cost

✍ Yiwei Jiang; Yong He 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 224 KB

Semi-Online Algorithms for Scheduling wi

Semi-Online Algorithms for Scheduling with Machine Cost

✍ Yi-Wei Jiang; Yong He 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 287 KB

Optimal semi-online algorithm for schedu

Optimal semi-online algorithm for scheduling with

✍ Xiao Min; Jing Liu; Yuqing Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 358 KB

Efficient Approximation Algorithms for T

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

✍ Piotr Berman; Bhaskar DasGupta; S Muthukrishnan; Suneeta Ramaswami 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 202 KB

We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In add

Local search algorithms for the rectangl

Local search algorithms for the rectangle packing problem with general spatial costs

✍ S. Imahori; M. Yagiura; T. Ibaraki 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 255 KB