Approximation algorithms for MAX-MIN tiling

Author： Berman P.   DasGupta B.   Muthukrishnan S.  

Publisher： Elsevier

ISSN： 0196-6774

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

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

Related content

Approximation Algorithms for Min-Max Tree Partition

By Guttmann-Beck N.   Hassin R.  

Journal of Algorithms, Vol. 24, Iss. 2, 1997-08 ,pp. : 266-286

Academic Press

Access to resources Recommend Favorite

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

By Berman P.   DasGupta B.   Muthukrishnan S.   Ramaswami S.  

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

Elsevier

Access to resources Recommend Favorite

Immunization and Max–Min Optimal Control

By Ghezzi L.L.  

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 701-711

Springer Publishing Company

Access to resources Recommend Favorite

Improved Approximation Algorithms for MAX SAT

By Asano T.   Williamson D.P.  

Journal of Algorithms, Vol. 42, Iss. 1, 2002-01 ,pp. : 173-202

Elsevier

Access to resources Recommend Favorite

On Approximation Algorithms for Hierarchical MAX-SAT

By Agarwal S.   Condon A.  

Journal of Algorithms, Vol. 26, Iss. 1, 1998-01 ,pp. : 141-165

Academic Press

Access to resources Recommend Favorite