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 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

Improved Approximation Algorithms for Uniform Connectivity Problems

By Khuller S.   Raghavachari B.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 434-450

Academic Press

Access to resources Recommend Favorite

Bicriteria Network Design Problems

By Marathe M.V.   Ravi R.   Sundaram R.   Ravi S.S.   Rosenkrantz D.J.   Hunt H.B.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 142-171

Academic Press

Access to resources Recommend Favorite

Bounded-degree spanning tree problems: models and new algorithms

By Cerulli R.   Gentili M.   Iossa A.  

Computational Optimization and Applications, Vol. 42, Iss. 3, 2009-04 ,pp. : 353-370

Springer Publishing Company

Access to resources Recommend Favorite