Results 1  10
of
1,964
On the Complexity of TimeDependent Shortest Paths
"... We investigate the complexity of shortest paths in timedependent graphs, in which the costs of edges vary as a function of time, and as a result the shortest path between two nodes s and d can change over time. Our main result is that when the edge cost functions are (polynomialsize) piecewise line ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We investigate the complexity of shortest paths in timedependent graphs, in which the costs of edges vary as a function of time, and as a result the shortest path between two nodes s and d can change over time. Our main result is that when the edge cost functions are (polynomialsize) piecewise
A simple cooperative diversity method based on network path selection
 IEEE J. SELECT. AREAS COMMUN
, 2006
"... Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investi ..."
Abstract

Cited by 452 (14 self)
 Add to MetaCart
. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same
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
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
Computing Geodesic Paths on Manifolds
 Proc. Natl. Acad. Sci. USA
, 1998
"... The Fast Marching Method [8] is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computational complexity. A ..."
Abstract

Cited by 294 (28 self)
 Add to MetaCart
. As an application, we provide an optimal time algorithm for computing the geodesic distances and thereby extracting shortest paths on triangulated manifolds. 1 Introduction Sethian`s Fast Marching Method [8], is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M
DISTRIBUTED SHORTESTPATH PROTOCOLS for TIMEDEPENDENT NETWORKS
, 1995
"... This paper addresses algorithms for networks whose behavior changes with time according to known functions. Because the computation depends on the the same functions it attempts to compute, its execution must obey strict timing constraints. When distributed versions of such algorithms are considered ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
are considered, a key difficulty is how to transfer local timing functions among the participating nodes. To that end it is necessary to characterize the parameterization of the functions and accommodate this parameterization in the computation. In particular, we consider the shortestpath problem in networks
Bicriterion shortest paths in stochastic timedependent networks
"... In recent years there has been a growing interest in using stochastic timedependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path, but ..."
Abstract
 Add to MetaCart
In recent years there has been a growing interest in using stochastic timedependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path
On Distributed TimeDependent Shortest Paths over DutyCycled Wireless Sensor Networks
"... Abstract—We revisit the shortest path problem in asynchronous dutycycled wireless sensor networks, which exhibit timedependent features. We model the timevarying link cost and distance from each node to the sink as periodic functions. We show that the timecost function satisfies the FIFO propert ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
property, which makes the timedependent shortest path problem solvable in polynomialtime. Using the βsynchronizer, we propose a fast distributed algorithm to build alltoone shortest paths with polynomial message complexity and time complexity. The algorithm determines the shortest paths for all
Journal of Theoretics Vol.43 Development of a Model and Algorithm for TimeDependent Shortest Path
"... Abstract: In this study, we analyzed the complexity of the TimeDependent Shortest Paths Problem (TD2SP) and its variants, and developed model and algorithm to solve this problem as well as more general versions of it in which the pair of paths is required to be only partially disjoint with respect ..."
Abstract
 Add to MetaCart
Abstract: In this study, we analyzed the complexity of the TimeDependent Shortest Paths Problem (TD2SP) and its variants, and developed model and algorithm to solve this problem as well as more general versions of it in which the pair of paths is required to be only partially disjoint
Results 1  10
of
1,964