Related content

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

By Xiao Mingyu   Cai Leizhen   Yao Andrew  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 510-520

Springer Publishing Company

Access to resources Recommend Favorite

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm

By Catusse N.   Chepoi V.   Nouioua K.   Vaxès Y.  

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 551-567

Springer Publishing Company

Access to resources Recommend Favorite

A fast distributed approximation algorithm for minimum spanning trees

By Khan Maleq   Pandurangan Gopal  

Distributed Computing, Vol. 20, Iss. 6, 2008-04 ,pp. : 391-402

Springer Publishing Company

Access to resources Recommend Favorite

New approximation algorithm for RTILE problem

By Lorys K.   Paluch K.E.  

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 517-537

Elsevier

Access to resources Recommend Favorite

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

By Fomin Fedor   Gaspers Serge   Pyatkin Artem   Razgon Igor  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 293-307

Springer Publishing Company

Access to resources Recommend Favorite