Timeline for Optimally directing switches for a random walk
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4, 2022 at 13:46 | comment | added | The Amplitwist |
The link to springerlink.com is broken. I'm also unable to find any snapshot saved on the Wayback Machine.
|
|
| Jan 14, 2011 at 22:09 | comment | added | Orange | I'm sorry, have we convinced ourselves this is NP hard? I remember thinking about this problem around Christmas and that was my belief then though I have no expertise here. | |
| Dec 28, 2010 at 20:05 | comment | added | aorq | @Re your edit: it's understandable that this paper might be related. I feel that I have one reasonable notion of what a switch means in a directed graph, and they have another one. Theirs is another reasonable notion, primarily motivated by the fact that trains cannot make very sharp turns, and so physical train switches can only be used "in one direction". | |
| Dec 28, 2010 at 19:59 | history | edited | optima | CC BY-SA 2.5 |
added 87 characters in body
|
| Dec 28, 2010 at 19:51 | comment | added | Chris Eagle | Yes, switch means something different there. | |
| Dec 28, 2010 at 19:44 | comment | added | fedja | Sounds fishy. Go back from $t$ and see from where you can reach it, expanding the set $S$. If you see a switch that can reach into the current version of $S$, just point it there and add it to $S$. Perhaps, the notions of a switch are different or they talk about full connectivity rather than reaching a given vertex. | |
| Dec 28, 2010 at 19:12 | history | answered | optima | CC BY-SA 2.5 |