Improved approximation algorithms for rectangle tiling and packing.

MaRDI QIDQ2768328zbMATH OpenFDO

Authors Piotr Berman, Bhaskar Dasgupta, S. Muthukrishnan, Suneeta Ramaswami

Publication date 30 January 2002

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient approximation algorithms for tiling and packing problems with rectangles
• A New Approximation Algorithm for Multidimensional Rectangle Tiling
• An approximation algorithm for square packing.
• Approximation algorithms for MAX–MIN tiling
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• A new heuristic algorithm for rectangle packing
• scientific article; zbMATH DE number 1263202
• scientific article; zbMATH DE number 4091172
• Automata, Languages and Programming
• Approximation algorithms for solving packing problems of convex polygons in plane

Cited in

(6)

• Efficient approximation algorithms for tiling and packing problems with rectangles
• Coloring and maximum independent set of rectangles
• A (2+)-approximation algorithm for the storage allocation problem
• Rectangle tiling binary arrays
• Dynamic streaming algorithms for geometric independent set
• Computationally-feasible truthful auctions for convex bundles

This page was built for publication: Improved approximation algorithms for rectangle tiling and packing.

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