We consider a generalization of the shortest-path problem: given an alphabet Σ, a graph G whose edges are weighted and Σ-labeled, and a regular language L ⊆ Σ∗, the L-constrained shortest-path problem consists of finding a shortest path p in G such that the concatenated labels along p form a word of L. This definition allows to model, e. g., many traffic-planning problems. We present extensions...

This paper describes a method for scheduling observations by earth-observing satellites. The underlying problem is translated into a directed acyclic graph for each satellite. Each arc in the graph has a profit related to the value associated with an image. Each arc of the graph also represents the constraints of the problem, including memory, time and orbits. The scheduling problem is solved b...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

This paper proposes a set of novel distributed algorithms on m-D mesh overlay configurations for short delay and low resource consumption application layer multicast. In contrast to previous approaches, our application layer multicast adopts two-layer tree architecture and the novelty and contribution are: (1) cluster formation algorithm assigns the closest group members into the same cluster t...

In this paper the shortest-path problem in networks is considered in which the delay (or weight) of the edges changes with time acc or ding to arbitrary functions. The author studied algorithms for finding the shortest-path and minimum delay under various waiting constraints and investigate the proper ties of the derived path. We show that if departure time from the source node is unrestricted ...