193 search results - page 11 / 39 » A Lower Bound for the Shortest Path Problem |
101
Voted
STOC
2010
ACM
15 years 9 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
98
Voted
STOC
2009
ACM
16 years 8 days ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
86
Voted
MST
2010
14 years 10 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...