Results 1  10
of
446
Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance
"... In a shortest path improvement problem under unit Hamming distance (denoted by SPIUH), an edge weighted graph with a set of sourceterminal pairs is given; we need to modify the lengths of edges by a minimum cost under unit Hamming distance such that the modified distances of the shortest paths are ..."
Abstract
 Add to MetaCart
In a shortest path improvement problem under unit Hamming distance (denoted by SPIUH), an edge weighted graph with a set of sourceterminal pairs is given; we need to modify the lengths of edges by a minimum cost under unit Hamming distance such that the modified distances of the shortest paths
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
THE SHORTESTPATH PROBLEM FOR GRAPHS WITH RANDOM ARCLENGTHS
, 1985
"... We consider the problem of finding the shortest distance between all pairs of vertices in a complete digraph on n vertices, whose arclengths are nonnegative random variables. We describe an algorithm which solves this problem in O(n(m + n log n)) expected time, where m is the expected number of ar ..."
Abstract

Cited by 102 (5 self)
 Add to MetaCart
We consider the problem of finding the shortest distance between all pairs of vertices in a complete digraph on n vertices, whose arclengths are nonnegative random variables. We describe an algorithm which solves this problem in O(n(m + n log n)) expected time, where m is the expected number
Improved shortest paths on the word RAM
 IN: 27TH COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP), IN: LECTURE NOTES IN COMPUT. SCI
, 2000
"... Thorup recently showed that singlesource shortestpaths problems in undirected networks with n vertices, m edges, and edge weights drawn from {0,...,2 w − 1} can be solved in O(n + m) time and space on a unitcost randomaccess machine with a word length of w bits. His algorithm works by traversin ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
Thorup recently showed that singlesource shortestpaths problems in undirected networks with n vertices, m edges, and edge weights drawn from {0,...,2 w − 1} can be solved in O(n + m) time and space on a unitcost randomaccess machine with a word length of w bits. His algorithm works
IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
"... We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set S, we look for a new point p / ∈ S that can be added, such that the shortest path from s to t, in the Delaunay triangulation of S ∪ {p}, improves as much as possible. ..."
Abstract
 Add to MetaCart
We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set S, we look for a new point p / ∈ S that can be added, such that the shortest path from s to t, in the Delaunay triangulation of S ∪ {p}, improves as much as possible
Shortest Path First with Emergency Exits
 IN PROCEEDINGS OF THE ACM SIGCOMM
, 1990
"... Under heavy and dynamic traffic, the SPF routing algorithm often suffers from wild oscillation and severe congestion, and results in degradation of the network performance. In this paper, we present a new routing algorithm (SPFEE) which attempts to eliminate the problems associated with the SPF alg ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
algorithm by providing alternate paths as emergency exits. With the SPFEE algorithm, traffic is routed along the shortestpaths under normal condition. However, in the presence of congestion and resource failures, the traffic can be dispersed temporarily to alternate paths without route re
Finding approximate repetitions under Hamming distance
 THEORETICAL COMPUTER SCIENCE
, 2001
"... The problem of computing tandem repetitions with K possible mismatches is studied. Two main definitions are considered, and for both of them an O(nK log K + S) algorithm is proposed (S the size of the output). This improves, in particular, the bound obtained in [LS93]. Finally, other possible defini ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
The problem of computing tandem repetitions with K possible mismatches is studied. Two main definitions are considered, and for both of them an O(nK log K + S) algorithm is proposed (S the size of the output). This improves, in particular, the bound obtained in [LS93]. Finally, other possible
Shortest Path Problem Under Intuitionistic Fuzzy Setting
"... In this article a fuzzy network has been considered whose edge weights are characterized by trapezoidal intuitionistic fuzzy numbers (TRIFNs).The network is acyclic with topological ordering. The shortest path and the corresponding path distance have been computed with the help of Bellman dynamic p ..."
Abstract
 Add to MetaCart
In this article a fuzzy network has been considered whose edge weights are characterized by trapezoidal intuitionistic fuzzy numbers (TRIFNs).The network is acyclic with topological ordering. The shortest path and the corresponding path distance have been computed with the help of Bellman dynamic
Shortest Paths for Line Segments
 ALGORITHMICA
, 1992
"... We study the problem of shortest paths for a line segment in the plane. As a measure of the distance traversed by a path, we take the average curve length of the orbits of prescribed points on the line segment. This problem is nontrivial even in free space (i.e., in the absence of obstacles). We cha ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We study the problem of shortest paths for a line segment in the plane. As a measure of the distance traversed by a path, we take the average curve length of the orbits of prescribed points on the line segment. This problem is nontrivial even in free space (i.e., in the absence of obstacles). We
Shortest Paths in Networks
"... Finding the shortest path between two points in a network is a fundamental problem in computer science with many applications. By exploiting properties of the underlying networks we improve and extend one of the stateoftheart al ..."
Abstract
 Add to MetaCart
Finding the shortest path between two points in a network is a fundamental problem in computer science with many applications. By exploiting properties of the underlying networks we improve and extend one of the stateoftheart al
Results 1  10
of
446