Results 1  10
of
592
Shortestpath and minimumdelay algorithms in networks with timedependent edgelength
 Journal of the ACM
, 1990
"... We consider in this paper the shortestpath problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions. We present algorithms for finding the shortestpath and minimumdelay under various waiting constraints and investigate the properties of th ..."
Abstract

Cited by 135 (6 self)
 Add to MetaCart
We consider in this paper the shortestpath problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions. We present algorithms for finding the shortestpath and minimumdelay under various waiting constraints and investigate the properties
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 139 (1 self)
 Add to MetaCart
to be restructured by an arbitrary mixture of edge insertions, edge deletions, and edgelength changes.
SHORTESTPATH AND MINIMUMDELA Y ALGORITHMS in NETWORKS WITH TIMEDEPENDENT EDGELENGTH
"... ABSTRACT We consider in this pape r the shortestpath problem in networ ks in which the dela y (or weight) of the edges change s with time acc ording to arbitra ry functions. We prese nt algorithms for finding the shortestpa th and minimum delay under various wa iting constra ints and investigate ..."
Abstract
 Add to MetaCart
ABSTRACT We consider in this pape r the shortestpath problem in networ ks in which the dela y (or weight) of the edges change s with time acc ording to arbitra ry functions. We prese nt algorithms for finding the shortestpa th and minimum delay under various wa iting constra ints
Incremental ShortestPath Problem
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract
 Add to MetaCart
to be restructured by an arbitrary mixture of edge insertions, edge deletions, and edgelength changes.
Refolding Planar Polygons
 DISCRETE & COMPUTATIONAL GEOMETRY
"... This paper describes an algorithm for generating a guaranteedintersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course of ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This paper describes an algorithm for generating a guaranteedintersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course
MODELING DYNAMIC WEIGHT FOR 3D NAVIGATION ROUTING
"... Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in timecritical applications such as emergency response applications. It doesn’t take into account dynamic emergency information changes at node/vertex level especially when applying ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to handle “multiple heterogeneous modifications”: between updates, the input graph is allowed to be restructured by an arbitrary mixture of edge insertions, edge deletions, and edgelength changes. The paper is organized in three general parts. The first part discusses the 3D navigation model, dynamic
Computational Geometry and Object Modeling—Shape Interpolation
"... This paper describes an algorithm for generating a guaranteedintersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course of th ..."
Abstract
 Add to MetaCart
This paper describes an algorithm for generating a guaranteedintersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course
Computational Geometry and Object Modeling—Shape Interpolation
"... This paper describes an algorithm for generating a guaranteedintersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course of th ..."
Abstract
 Add to MetaCart
This paper describes an algorithm for generating a guaranteedintersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course
Facility Location with Dynamic Distance Functions
"... Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlying network could be used to model a city street network for emergency facility location/hospitals, or an electronic network for locating in ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlying network could be used to model a city street network for emergency facility location/hospitals, or an electronic network for locating
Facility Location with Dynamic Distance Functions
"... Abstract. Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlying network could be used to model a city street network for emergency facility location/hospitals, or an electronic network for l ..."
Abstract
 Add to MetaCart
Abstract. Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlying network could be used to model a city street network for emergency facility location/hospitals, or an electronic network
Results 1  10
of
592