3678 search results - page 108 / 736 » On the Stable Paths Problem |
147
click to vote
COR
2008
15 years 10 days ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
105
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
93
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
105
Voted
COMBINATORICS
2002
15 years 17 days ago
2002
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
116
click to vote
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...