Add to ORKGWe show that the optimum shortcut, with respect to routing cost, in a directed path with weighted vertices can be found in linear time. To this end, we construct in linear time the lower envelope of an arrangement of pseudo-lines whose order at infinity is given
We present a new algorithm, called K*, for finding the k shortest paths between a designated pair of...
We propose a protocol optimization technique that is applicable to both weighted and unweighted grap...
How to improve the transfer capability of the weighted networks is one of the most important problem...
We augment a plane Euclidean network with a segment or shortcut to minimize the largest distance bet...
We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the large...
We investigate the minimum weight path problem in networks whose link weights and link delays are bo...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
We consider the problem of maintaining on-line a solution to the All Pairs Shortest Paths Problem in...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
Given a set of points and distances between them, a basic problem in network design calls for select...
In this paper, we show that the shortest path between two points in a grid-like arrangement of two p...
Abstract. Computing shortest paths in graphs is used for finding good connections in railway timetab...
AbstractWe give a polynomial algorithm to compute shortest paths in weighted undirected graphs with ...
We give a polynomial algorithm to compute shortest paths in weighted undirected graphs with no negat...
The problem of finding a shortest Euclidean path in an arrangement of lines between two points in th...
We present a new algorithm, called K*, for finding the k shortest paths between a designated pair of...
We propose a protocol optimization technique that is applicable to both weighted and unweighted grap...
How to improve the transfer capability of the weighted networks is one of the most important problem...
We augment a plane Euclidean network with a segment or shortcut to minimize the largest distance bet...
We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the large...
We investigate the minimum weight path problem in networks whose link weights and link delays are bo...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
We consider the problem of maintaining on-line a solution to the All Pairs Shortest Paths Problem in...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
Given a set of points and distances between them, a basic problem in network design calls for select...
In this paper, we show that the shortest path between two points in a grid-like arrangement of two p...
Abstract. Computing shortest paths in graphs is used for finding good connections in railway timetab...
AbstractWe give a polynomial algorithm to compute shortest paths in weighted undirected graphs with ...
We give a polynomial algorithm to compute shortest paths in weighted undirected graphs with no negat...
The problem of finding a shortest Euclidean path in an arrangement of lines between two points in th...
We present a new algorithm, called K*, for finding the k shortest paths between a designated pair of...
We propose a protocol optimization technique that is applicable to both weighted and unweighted grap...
How to improve the transfer capability of the weighted networks is one of the most important problem...