Timeline for Computing topological sort while keeping edges "short"
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2018 at 8:08 | history | edited | Gamow | CC BY-SA 4.0 |
added 76 characters in body
|
| May 25, 2018 at 4:35 | vote | accept | Chirag Jain | ||
| May 25, 2018 at 0:49 | comment | added | Chandra Chekuri | The 2-approximation is for a very restricted class of graphs. I am not sure what is known in general. Bandwidth in undirected graphs admits a poly-logarithmic approximation. sciencedirect.com/science/article/pii/S0022000099916823 | |
| May 24, 2018 at 8:36 | history | answered | Gamow | CC BY-SA 4.0 |