182 search results - page 9 / 37 » Routing Tree Problems on Random Graphs |
148
Voted
SAC
2003
ACM
15 years 7 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
104
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
106
click to vote
INFORMS
2008
15 years 1 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
112
click to vote
ICRA
2002
IEEE
15 years 6 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
111
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...