Timeline for Update SSSPP solution on complete digraph on weight changes
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 30, 2014 at 13:06 | history | edited | Raphael | CC BY-SA 3.0 |
edited title
|
| Jan 30, 2014 at 13:05 | comment | added | Raphael | Remembered an older question on how many shortest paths may change when one edge is updated, but that one assumes APSPP. | |
| Jan 30, 2014 at 11:42 | comment | added | jleahy | @Raphael What kind of routing algorithm would you suggest? I'm aware it's non-trivial, but I was hoping at least an O(n^2) single-edge update would be possible. | |
| Jan 30, 2014 at 11:01 | comment | added | Raphael | Have you looked into routing algorithms? They solve exactly this problem, and it's non-trivial. | |
| Jan 30, 2014 at 11:00 | history | edited | Raphael |
edited tags
|
|
| Jan 30, 2014 at 10:33 | history | edited | jleahy | CC BY-SA 3.0 |
Explicitly mention negative weights and mention Bellman-Ford
|
| Jan 30, 2014 at 8:01 | history | edited | Carlos Linares López | CC BY-SA 3.0 |
Minor changes
|
| Jan 30, 2014 at 0:34 | comment | added | Yuval Filmus | What have you tried? Where did you get stuck? Have you tried searching the internet for dynamic single-source shortest path algorithms? | |
| Jan 29, 2014 at 23:32 | review | First posts | |||
| Jan 30, 2014 at 8:05 | |||||
| Jan 29, 2014 at 23:13 | history | asked | jleahy | CC BY-SA 3.0 |