Results 1  10
of
932
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 739 (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
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 657 (27 self)
 Add to MetaCart
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route
The New Routing Algorithm for the ARPANET
 IEEE TRANSACTIONS ON COMMUNICATIONS
, 1980
"... The new ARPANET routing algorithm is an improvement test results. This paper is a summary of our conclusions only; over the old procedure in that it uses fewer network resources, operates on for more complete descriptions of our research findings, see more realistic estimates of network conditions, ..."
Abstract

Cited by 300 (2 self)
 Add to MetaCart
, reacts faster to important our internai reports on this project [3][5]. network changes, and does not suffer from longterm loops or oscillations. In the new procedure, each node in the network maintains a database 11. PROBLEMS WITH THE ORIGINAL ALGORITHM describing the complete network topology
Routing and Wavelength Assignment in AllOptical Networks
 IEEE/ACM Transactions on Networking
, 1995
"... This paper considers the problem of routing connections in a reconfigurable optical network using wavelength division multiplexing, where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths sha ..."
Abstract

Cited by 264 (9 self)
 Add to MetaCart
This paper considers the problem of routing connections in a reconfigurable optical network using wavelength division multiplexing, where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths
FASTER ALGORITHMS FOR ALLPAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS
, 2006
"... Let G = (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate ˆ δ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t iff δ(u, v) ≤ ˆ δ(u, v) ≤ t · δ(u, v). Computing allpairs small stretch distances efficiently (both in terms of time ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
and space) is a wellstudied problem in graph algorithms. We present a simple, novel and generic scheme for allpairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for allpairs tstretch distances for a whole range of stretch t, and also answer
Faster Algorithms for Approximate Distance Oracles and AllPairs Small StretchPaths
"... ffi(u, v) < = ^ffi(u, v) < = t * ffi(u, v). The most efficient algorithms known for computing small stretch distances in Gare the approximate distance oracles of [16] and the three algorithms in [9] to compute allpairs stretch t distancesfor t = 2, 7/3, and 3. We present faster algorithms fo ..."
Abstract
 Add to MetaCart
ffi(u, v) < = ^ffi(u, v) < = t * ffi(u, v). The most efficient algorithms known for computing small stretch distances in Gare the approximate distance oracles of [16] and the three algorithms in [9] to compute allpairs stretch t distancesfor t = 2, 7/3, and 3. We present faster algorithms
Efficient Algorithms for the Problems of Enumerating Cuts by Nondecreasing Weights
 ALGORITHMICA
, 2009
"... In this paper, we study the problems of enumerating cuts of a graph by nondecreasing weights. There are four problems, depending on whether the graph is directed or undirected, and on whether we consider all cuts of the graph or only st cuts for a given pair of vertices s,t. Efficient algorithms ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we study the problems of enumerating cuts of a graph by nondecreasing weights. There are four problems, depending on whether the graph is directed or undirected, and on whether we consider all cuts of the graph or only st cuts for a given pair of vertices s,t. Efficient
All Pairs Almost Shortest Paths
 SIAM Journal on Computing
, 1996
"... Let G = (V; E) be an unweighted undirected graph on n vertices. A simple argument shows that computing all distances in G with an additive onesided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of Aingworth, Chekuri and Motwani, we describe g) time ..."
Abstract

Cited by 91 (7 self)
 Add to MetaCart
algorithm APASP 2 for computing all distances in G with an additive onesided error of at most 2. The algorithm APASP 2 is simple, easy to implement, and faster than the fastest known matrix multiplication algorithm. Furthermore, for every even k ? 2, we describe an g) time algorithm APASP k
On the exponent of the all pairs shortest path problem
"... The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even for t ..."
Abstract

Cited by 84 (2 self)
 Add to MetaCart
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even
Results 1  10
of
932