Related content

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

By Gaur D.R.   Ibaraki T.   Krishnamurti R.  

Journal of Algorithms, Vol. 43, Iss. 1, 2002-04 ,pp. : 138-152

Academic Press

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

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

Approximation Algorithms for the Class Cover Problem

By Cannon Adam H.  

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 215-223

Springer Publishing Company

Access to resources Recommend Favorite

Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

By Samphaiboon N.   Yamada Y.  

Journal of Optimization Theory and Applications, Vol. 105, Iss. 3, 2000-06 ,pp. : 659-676

Springer Publishing Company

Access to resources Recommend Favorite