Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
Work
Year: 2009
Type: article
Source: Algorithmica
Institutions University of Electronic Science and Technology of China, Chinese University of Hong Kong, Tsinghua University
Cites: 23
Cited by: 13
Related to: 10
FWCI: 0.301
Citation percentile (by year/subfield): 70.41
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed