Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem - Xiao, Mingyu; Cai, Leizhen; Yao, Andrew Chi-Chih (Algorithmica, 2011)
Keywords: Algorithm Analysis and Problem Complexity; Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Computer Science; Computer science; control theory; systems; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Exact sciences and technology; Mathematics of Computing; Theoretical computing; Theory of Computation; Approximation algorithm; way cut; Edge(graph); K cut problem; Graph connectivity; NP hard problem; Greedy algorithm; Connected graph; Iterative method; k-way cut; Weighted graph; Non directed graph