Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of algorithms 2001-11, Vol.41 (2), p.443-470
Hauptverfasser: Berman, Piotr, DasGupta, Bhaskar, Muthukrishnan, S, Ramaswami, Suneeta
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!