Talk:Minimum k-cut

Isn't the statement about metric minimum k-cuts (that they can be approximated by a factor of 3) dominated by the 2 - 2/k approximation greedy algorithm? // Cachedio (talk) 17:32, 30 November 2010 (UTC)
 * The problem variant you are referring to has as additional requirement that the vertex sets in the partition have predefined, given sizes. Therefore, the approximation ratios for the two different problems can not be compared directly. (In an earlier version, the formulation of the problem variant in the wiki article has been misleading.) Joerg Bader (talk) 11:26, 14 February 2018 (UTC)

|V|^{k^2} result outdated
Karger's paper shows a randomized |V|^{2k} algorithm, much faster than |V|^(k*k). An expert in the field also noted that there is a deterministic |V|^{2k} algorithm. — Preceding unsigned comment added by TheZuza777 (talk • contribs) 01:43, 23 October 2016 (UTC)

External links modified (February 2018)
Hello fellow Wikipedians,

I have just modified one external link on Minimum k-cut. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20091212080856/http://www-ma4.upc.es/~comellas/evocomnet06/CoSa06-EvoCOMNET06.html to http://www-ma4.upc.es/~comellas/evocomnet06/CoSa06-EvoCOMNET06.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 02:23, 1 February 2018 (UTC)