The following pages link to On the greedy walk problem (Q383202):
Displaying 11 items.
- Greedy clearing of persistent Poissonian dust (Q404143) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867) (← links)
- Two queues with non-stochastic arrivals (Q1667172) (← links)
- The critical greedy server on the integers is recurrent (Q1737969) (← links)
- The greedy walk on an inhomogeneous Poisson process (Q1748566) (← links)
- Greedy walk on the real line (Q2352757) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q2861508) (← links)
- On the difficulty of finding walks of length k (Q4385673) (← links)
- (Q4489209) (← links)
- A Theory for Backtrack-Downweighted Walks (Q5006453) (← links)
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS (Q5051225) (← links)
