Results 1  10
of
605
MINIMUM WEIGHT PATHS in TIMEDEPENDENT NETWORKS
 NETWORKS
, 1991
"... We investigate the minimum weight path problem in networks whose link weights and link delays are both functions of time. We demonstrate that in general there exist cases in which no finite path is optimal leading us to define an infinite path (naturally, containing loops) in such a way that the min ..."
Abstract

Cited by 40 (3 self)
 Add to MetaCart
We investigate the minimum weight path problem in networks whose link weights and link delays are both functions of time. We demonstrate that in general there exist cases in which no finite path is optimal leading us to define an infinite path (naturally, containing loops) in such a way
An Efficient Algorithm for MinimumWeight Bibranching
 JOURNAL OF COMBINATORIAL THEORY
, 1996
"... Given a directed graph D = (V; A) and a set S ` V , a bibranching is a set of arcs B ` A that contains a v(V n S) path for every v 2 S and an Sv path for every v 2 V n S. In this paper, we describe a primaldual algorithm that determines a minimum weight bibranching in a weighted digraph. It ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Given a directed graph D = (V; A) and a set S ` V , a bibranching is a set of arcs B ` A that contains a v(V n S) path for every v 2 S and an Sv path for every v 2 V n S. In this paper, we describe a primaldual algorithm that determines a minimum weight bibranching in a weighted digraph
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
are given. We show that, if each flow augmentation is made along an augmenting path having a minimum number of arcs, then a maximum flow in an nnode network will be obtained after no more than ~(n a n) augmentations; and then we show that if each flow change is chosen to produce a maximum increase
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
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 414 (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
Results 1  10
of
605