422 search results - page 15 / 85 » Shortest paths between shortest paths and independent sets |
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
JUCS
2010
13 years 6 months ago
2010
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
ISAAC
2009
Springer
14 years 2 days ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...