Results 1 - 10 of 592

Shortest-path and minimumdelay algorithms in networks with time-dependent edge-length

by Ariel Orda, Raphael Rom - Journal of the ACM , 1990
"... We consider in this paper the shortest-path 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 shortest-path and minimum-delay 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 shortest-path 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 shortest-path and minimum-delay under various waiting constraints and investigate the properties

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

by G. Ramalingam, Thomas Reps , 1992
"... The grammar problem, a generalization of the single-source shortest-path problem introduced by Knuth, is to compute the minimum-cost derivation of a terminal string from each non-terminal of a given context-free 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 edge-length changes.

SHORTEST-PATH AND MINIMUM-DELA Y ALGORITHMS in NETWORKS WITH TIME-DEPENDENT EDGE-LENGTH

by Ariel Orda , Raphael Rom
"... ABSTRACT We consider in this pape r the shortest-path 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 shortest-pa th and minimum -delay under various wa iting constra ints and investigate ..."
Abstract - Add to MetaCart
ABSTRACT We consider in this pape r the shortest-path 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 shortest-pa th and minimum -delay under various wa iting constra ints

Incremental Shortest-Path Problem

by G. Ramalingam, Thomas Reps, G. Ramalingam
"... The grammar problem, a generalization of the single-source shortest-path problem introduced by Knuth, is to compute the minimum-cost derivation of a terminal string from each non-terminal of a given context-free 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 edge-length changes.

Refolding Planar Polygons

by Hayley N. Iben, James F. O’Brien, Erik D. Demaine - DISCRETE & COMPUTATIONAL GEOMETRY
"... This paper describes an algorithm for generating a guaranteed-intersection-free 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 guaranteed-intersection-free 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

by Ivin Amri Musliman, Alias Abdul Rahman, Volker Coors
"... Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical 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 edge-length 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

by unknown authors
"... This paper describes an algorithm for generating a guaranteedintersection-free 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 guaranteedintersection-free 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

by unknown authors
"... This paper describes an algorithm for generating a guaranteedintersection-free 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 guaranteedintersection-free 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

by Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
"... 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

by Yoram J. Sussmannz, Ding-zhu Du
"... 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