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

Author： Xiao Mingyu   Cai Leizhen   Yao Andrew  

Publisher： Springer Publishing Company

ISSN： 0178-4617

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

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

Greedy algorithm for the general multidimensional knapsack problem

By Akçay Yalçın  

Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. : 17-29

Springer Publishing Company

Access to resources Recommend Favorite

An Approximation Algorithm for the Minimum Co-Path Set Problem

By Chen Zhi-Zhong   Lin Guohui   Wang Lusheng  

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 969-986

Springer Publishing Company

Access to resources Recommend Favorite

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

By Ahuja Ravindra K.   Hochbaum Dorit S.   Orlin James B.  

Algorithmica, Vol. 39, Iss. 3, 2004-04 ,pp. : 189-208

Springer Publishing Company

Access to resources Recommend Favorite

On greedy construction heuristics for the MAX-CUT problem

By Kahruman Sera   Kolotoglu Elif   Butenko Sergiy   Hicks Illya V.  

International Journal of Computational Science and Engineering, Vol. 3, Iss. 3, 2008-04 ,pp. : 211-218

Inderscience Publishers

Access to resources Recommend Favorite

Minimum k Arborescences with Bandwidth Constraints

By Cai Mao-cheng   Deng Xiaotie   Wang Lusheng  

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 529-537

Springer Publishing Company

Access to resources Recommend Favorite