On Weighted vs Unweighted Versions of Combinatorial Optimization Problems

By Crescenzi P.   Silvestri R.   Trevisan L.  

Information and Computation, Vol. 167, Iss. 1, 2001-05 ,pp. : 10-26

Academic Press

Access to resources Recommend Favorite

Approximating Clique and Biclique Problems

By Hochbaum D.S.  

Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. : 174-200

Academic Press

Access to resources Recommend Favorite

Approximating k -generalized connectivity via collapsing HSTs

By Segev Danny  

Journal of Combinatorial Optimization, Vol. 21, Iss. 3, 2011-04 ,pp. : 364-382

Springer Publishing Company

Access to resources Recommend Favorite

Approximating Layout Problems on Random Geometric Graphs

By Díaz J.   Penrose M.D.   Petit J.   Serna M.  

Journal of Algorithms, Vol. 39, Iss. 1, 2001-04 ,pp. : 78-116

Academic Press

Access to resources Recommend Favorite

Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property

By Bar-Yehuda R.   Rawitz D.  

Journal of Algorithms, Vol. 42, Iss. 1, 2002-01 ,pp. : 20-40

Elsevier

Access to resources Recommend Favorite