Sciweavers

1447 search results - page 33 / 290
» Graphs and Path Equilibria
Sort
View
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 2 months ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh
JCT
2006
69views more  JCT 2006»
13 years 9 months ago
Short paths in quasi-random triple systems with sparse underlying graphs
The Frankl-R
Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski...
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
14 years 2 months ago
On Shortest Disjoint Paths in Planar Graphs
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...
Yusuke Kobayashi, Christian Sommer 0002
NETWORKS
2011
13 years 4 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 7 months ago
Compressive Sensing over Graphs
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
Weiyu Xu, Enrique Mallada, Ao Tang