353 search results - page 3 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
150
Voted
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
160
Voted
FOCS
2010
IEEE
15 years 19 days ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
104
Voted
CPAIOR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
133
Voted
JCP
2007
15 years 2 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
146
Voted
DAM
2000
15 years 2 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to