Timeline for Minimum delay path in time-dependent graph
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 21, 2020 at 15:07 | history | bounty ended | CommunityBot | ||
| S Nov 21, 2020 at 15:07 | history | notice removed | CommunityBot | ||
| Nov 15, 2020 at 8:37 | comment | added | lchen | Thank you for your comment. Why is the problem not well-defined? Each edge $e$ is associated with a set of time intervals $[a_1,b_1],[a_2,b_2],\cdots$, during which the edge is ON. These intervals are given. $T$ is the time horizon, which is a real number. | |
| Nov 15, 2020 at 6:25 | comment | added | domotorp | This problem is not well defined at the moment. How is the time-dependency encoded in the input? Is $T$ in unary or given in binary? | |
| S Nov 13, 2020 at 13:53 | history | bounty started | lchen | ||
| S Nov 13, 2020 at 13:53 | history | notice added | lchen | Authoritative reference needed | |
| S Oct 13, 2020 at 9:01 | history | bounty ended | CommunityBot | ||
| S Oct 13, 2020 at 9:01 | history | notice removed | CommunityBot | ||
| Oct 11, 2020 at 12:34 | comment | added | lchen | Is there a way to prove that the problem is NP-complete? | |
| S Oct 5, 2020 at 6:16 | history | bounty started | lchen | ||
| S Oct 5, 2020 at 6:16 | history | notice added | lchen | Authoritative reference needed | |
| Oct 2, 2020 at 5:17 | comment | added | lchen | We may also consider the discrete scenario where $t\in \mathbb{Z}$. | |
| Oct 2, 2020 at 4:20 | comment | added | RobPratt | Does $t$ take only finitely many values? | |
| Oct 2, 2020 at 3:42 | history | asked | lchen | CC BY-SA 4.0 |