Timeline for Algorithms from the Book
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2010 at 16:12 | history | edited | Jukka Suomela | CC BY-SA 2.5 |
highlight
|
| Aug 17, 2010 at 20:23 | comment | added | Aaron Roth | Yes, a very nice algorithm. Less trivially, at the cost of another factor of 2, this algorithm also works for maximizing any submodular function, not just the graph cut function. This is a result of Feige, Mirrokni, and Vondrak from FOCS 07 | |
| Aug 17, 2010 at 20:18 | history | answered | arnab | CC BY-SA 2.5 |