Results 1  10
of
201,760
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 738 (18 self)
 Add to MetaCart
in the problem graph: ( 1) O(n log n + m) for the singlesource shortest path problem with nonnegative edge lengths, improved from O(m logfmh+2)n); (2) O(n*log n + nm) for the allpairs shortest path problem, improved from O(nm lo&,,,+2,n); (3) O(n*logn + nm) for the assignment problem (weighted bipartite
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 412 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
Shortest
"... The k nearest neighbor object to a point in space is the most regularly used query in finding shortest path of a given network. In this paper we present an efficient pruning method to find the nearest neighbor to a point for finding the shortest path. Finally we present the results of several experi ..."
Abstract
 Add to MetaCart
The k nearest neighbor object to a point in space is the most regularly used query in finding shortest path of a given network. In this paper we present an efficient pruning method to find the nearest neighbor to a point for finding the shortest path. Finally we present the results of several
Computing Shortest Paths with Uncertainty
 IN PROCEEDINGS OF STACS
, 2003
"... We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, each edge e is known only to lie within an interval [l e ; he ]; the estimation algorithm can pay ce to find the exact ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, each edge e is known only to lie within an interval [l e ; he ]; the estimation algorithm can pay ce to find the exact
Online and Dynamic Algorithms for Shortest Path Problems
 Proc. 12th Symp. on Theor. Aspects of Comp. Sc. (STACS'95), LNCS 900
, 1995
"... Abstract. We describe algorithms for finding shortest paths and distances in a planar digraph which exploit the particular topology of the input graph. An important feature of our algorithms is that they can work in a dynamic environment, where the cost of any edge can be changed or the edge can be ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Abstract. We describe algorithms for finding shortest paths and distances in a planar digraph which exploit the particular topology of the input graph. An important feature of our algorithms is that they can work in a dynamic environment, where the cost of any edge can be changed or the edge can
Computing Shortest Paths with Comparisons and Additions
 SODA
, 2002
"... We present an undirected allpairs shortest paths (APSP) algorithm which runs on a pointer machine in time O(mnot(m, n)) while making O(ran log a(m, n)) comparisons and additions, where m and n are the number of edges and vertices, respectively, and a(ra, n) is Tarjan's inverseAckermann funct ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
We present an undirected allpairs shortest paths (APSP) algorithm which runs on a pointer machine in time O(mnot(m, n)) while making O(ran log a(m, n)) comparisons and additions, where m and n are the number of edges and vertices, respectively, and a(ra, n) is Tarjan's inverse
Efficient Shortest Paths on Massive Social Graphs
"... Abstract—Analysis of large networks is a critical component of many of today’s application environments, including online social networks, protein interactions in biological networks, and Internet traffic analysis. The arrival of massive network graphs with hundreds of millions of nodes, e.g. social ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
for graphs up to 43 million nodes. Finally, we show that Rigel’s functionality can be easily extended to locate (near) shortest paths between node pairs. After a onetime preprocessing cost, Rigel answers nodedistance queries in 10’s of microseconds, and also produces shortest path results up to 18 times
Results 1  10
of
201,760