Talk:Minimum k-cut

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

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)[reply]

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)[reply]

|V|^{k^2} result outdated[edit]

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 (talkcontribs) 01:43, 23 October 2016 (UTC)[reply]

External links modified (February 2018)[edit]

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:

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

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 18 January 2022).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

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