Results 231 to 240 of about 47,764 (259)

The shortest network under a given topology

Journal of Algorithms, 1992
Summary: Given a set of fixed points, a set of moving points in the Euclidean plane, and a set of edges connecting these points, the problem we consider is that of locating the moving points so as to minimize the total length of edges, where zero-length edges are allowed. We study the special case where each point has degree at most three and show that
Frank K. Hwang, J. F. Weng
openaire   +1 more source

Encoding shortest paths in spatial networks

Networks, 1995
AbstractA new data structure is presented which facilitates the search for shortest paths in spatially embedded planar networks in a worst‐case time of O(l log r), where l is the number of edges in the shortest path to be found and r is an upper bound on the number of so‐called cross edges (these are edges connecting, for any node v, different shortest
openaire   +1 more source

On the Evaluation of Shortest Journeys in Dynamic Networks

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 2007
The assessment of routing protocols for wireless networks is a difficult task, because of the networks' highly dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and low earth orbit (LEO) satellites systems, have more predictable dynamics, as the ...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro   +2 more
openaire   +1 more source

Shortest distance and reliability of probabilistic networks

Computers & Operations Research, 1976
Abstract When the “length” of a link is not deterministic and is governed by a stochastic process, the “shortest” path between two points in the network is not necessarily always composed of the same links and depends on the state of the network. For example, in communication and transportation networks, the travel time on a link is not deterministic
openaire   +1 more source

Shortest Networks on Surfaces

1998
Suppose A = {a l, a 2, ... , a n } is a point set in a metric space M. The shortest network problem asks for a minimum length network S(A) that interconnects all points of A (called terminals), possibly with some additional points to shorten the network. S(A) must be a tree since it cannot contain any cycle for minimality.
openaire   +1 more source

A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS

Asia-Pacific Journal of Operational Research, 2013
We present two new linear algorithms for the single source shortest paths problem. The worst case running time of the first algorithm is O(m + C log C), where m is the number of edges of the input network and C is the ratio of the largest and the smallest edge weight.
Dragan Vasiljevic, Milos Danilovic
openaire   +3 more sources

Construction of centered shortest‐path trees in networks

Networks, 1983
AbstractMany researchers in the area of distributed networks have found it convenient to assume the existence of a facility for routing broadcast messages to all the nodes in the network. We are investigating an approach called center‐based forwarding which routes messages via the branches of the shortest‐path tree for some node near the center of the ...
David W. Wall, Susan S. Owicki
openaire   +1 more source

A Shortest Path Algorithm with Constraints in Networks

2011
The paper deals with the shortest path problem with Constraints, and it is NP-complete problem. The problem is formulated as an optimization model. To solve this model Lagrangean relaxation algorithm is adopted. For the solution of the dual problem a subgradient method is used.
Fanguo He, Kuobin Dai
openaire   +1 more source

On shortest networks for classes of points in the plane

1991
We are given a set $P$ of points in the plane, together with a partition of $P$ into {\em classes\/} of points; i.e., each point of $P$ belongs to exactly one class. For a given network optimization problem, such as finding a minimum spanning tree or finding a minimum diameter spanning tree, we study the problem of choosing a subset $P''$ of $P$ that ...
Edmund Ihler, Gabriele Reich, Peter Widmayer   +2 more
openaire   +1 more source

Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM, 1977
Algorithms for finding shortest paths are presented which are faster than algorithms previously known on networks which are relatively sparse in arcs. Known results which the results of this paper extend are surveyed briefly and analyzed. A new implementation for priority queues is employed, and a class of “arc set partition” algorithms is
openaire   +1 more source