![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Approximation algorithms for MAX-MIN tiling
By Berman P. DasGupta B. Muthukrishnan S.
Journal of Algorithms, Vol. 47, Iss. 2, 2003-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
An efficient deterministic optimization approach for rectangular packing problems
By Tsai Jung-Fa
Optimization, Vol. 62, Iss. 7, 2013-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. :