We present an exact solution to the DBCP which is based on the branch-and-bound paradigm. We also propose a heuristic technique to solve the DBCP using the�...

As the amount of data transmitted over a net- work increases and high bandwidth applications re- quiring point to multipoint communications like video-.

This paper deals with the delay-bounded cost-optimal multicast tree (DBCMT) generation problem. Speci cal ly,we discuss a closely related problem which is to�...

This work discusses a closely related problem which is to find a delay-bounded cost-optimal path (DBCP) between a specified source and destination node and�...

This paper deals with the delay-bounded cost-optimal multicast tree (DBCMT) generation problem. A closely related problem is to find a delay-bounded cost-�...

problem is to identify the minimal cost path on a network from a pre-specified starting node to a pre-specified terminus node. The path must cover all of�...

Abstract. 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�...

The goal in shortest path tree (SPT) algorithm is to compute a tree rooted at the sender and spanning all the receivers such that the distance between the�...

Aug 27, 2018 � In this paper we introduce two efficient algorithms for solving the SCPP. The first is a heuristic based upon a Lagrangian relaxation of the�...

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�...