Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

Author： Berman P. DasGupta B. Muthukrishnan S. Ramaswami S.

Publisher： Elsevier

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.41, Iss.2, 2001-11, pp. : 443-470

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximation algorithms for MAX-MIN tiling

By Berman P. DasGupta B. Muthukrishnan S.

Journal of Algorithms, Vol. 47, Iss. 2, 2003-07 ,pp. : 122-134

Elsevier

Access to resources Recommend Favorite

Approximation algorithms for general packing problems and their application to the multicast congestion problem

By Jansen Klaus

Mathematical Programming, Vol. 114, Iss. 1, 2008-07 ,pp. : 183-206

Springer Publishing Company

Access to resources Recommend Favorite

Exact and approximation algorithms for a soft rectangle packing problem

By Fügenschuh Armin Junosza-Szaniawski Konstanty Lonc Zbigniew

Optimization, Vol. 63, Iss. 11, 2014-11 ,pp. : 1637-1663

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient deterministic optimization approach for rectangular packing problems

By Tsai Jung-Fa

Optimization, Vol. 62, Iss. 7, 2013-07 ,pp. : 989-1002

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

By Feige U. Langberg M.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 174-211

Elsevier

Access to resources Recommend Favorite