Timeline for A Multi-cut Problem
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18 at 8:54 | answer | added | badboul | timeline score: 0 | |
| Dec 11, 2010 at 22:00 | vote | accept | Aaron Roth | ||
| Dec 10, 2010 at 13:45 | answer | added | Gianluca Della Vedova | timeline score: 12 | |
| Dec 10, 2010 at 2:47 | answer | added | Tsuyoshi Ito | timeline score: 11 | |
| Dec 9, 2010 at 23:50 | answer | added | David Eppstein | timeline score: 18 | |
| Dec 9, 2010 at 23:32 | comment | added | Jukka Suomela | To get more intuition about the problem, what do you know about simple special cases? For example, what if the weights are just $+1$ or $-1$? What if $G$ is a complete graph and the weights are $\pm 1$? | |
| Dec 9, 2010 at 23:00 | history | edited | Kaveh |
edited tags
|
|
| Dec 9, 2010 at 21:25 | history | asked | Aaron Roth | CC BY-SA 2.5 |