Timeline for Single pair shortest path algorithm with time a constraint
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 6, 2017 at 1:24 | comment | added | ironstein | Hi, thanks for the answer. Is there any way we can make this problem not NP-hard by adding additional constraints. I mean, off the top of my head, something like we can introduce departure times for each of the flights. Would that make any difference? | |
| Oct 5, 2017 at 21:36 | history | edited | cardobard_box | CC BY-SA 3.0 |
added 8 characters in body
|
| Oct 5, 2017 at 21:29 | history | answered | cardobard_box | CC BY-SA 3.0 |