Add to ORKGWe consider a problem of cost-constrained minimum-delay multicasting in a network, which is to find a Steiner tree spanning the source and destination nodes such that the maximum total delay along a path from the source node to a destination node is minimized, while the sum of link costs in the tree is bounded by a constant. The problem is NP-hard even if the network is series-parallel. We present a fully polynomial time approximation scheme for the problem if the network is series-parallel
Abstract. The problem of minimizing the maximum edge conges-tion in a multicast communication networ...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
Abstract. We consider a problem of cost-constrained minimum-delay multicasting in a network, which i...
A new heuristic algorithm is presented for constructing minimum-cost multicast trees with delay cons...
Most network-based multimedia applications require multicasting with constraints such as bandwidth a...
We propose an algorithm for finding a multicast tree in packet-switched networks. The objective is t...
Abstract- We propose an algorithm forfinding a multicast tree in packet-switched networks. The objec...
ABSTRACT The Distributed multicast routing protocol under delay constraints, is one of the software...
We give a multicast tree construction method for delay-sensitive applications by first trying to com...
In order to optimize cost and decrease complexity with a delay upper bound, the delay-constrained St...
We formulate the problem of multicast tree generation as one of computing a directed Steiner tree of...
We formulate the problem of constructing broadcast trees for real-time traffic with delay constraint...
AbstractWe present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with v...
We consider the problem of constructing a multicast tree that connects a group of source nodes to ...
Abstract. The problem of minimizing the maximum edge conges-tion in a multicast communication networ...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
Abstract. We consider a problem of cost-constrained minimum-delay multicasting in a network, which i...
A new heuristic algorithm is presented for constructing minimum-cost multicast trees with delay cons...
Most network-based multimedia applications require multicasting with constraints such as bandwidth a...
We propose an algorithm for finding a multicast tree in packet-switched networks. The objective is t...
Abstract- We propose an algorithm forfinding a multicast tree in packet-switched networks. The objec...
ABSTRACT The Distributed multicast routing protocol under delay constraints, is one of the software...
We give a multicast tree construction method for delay-sensitive applications by first trying to com...
In order to optimize cost and decrease complexity with a delay upper bound, the delay-constrained St...
We formulate the problem of multicast tree generation as one of computing a directed Steiner tree of...
We formulate the problem of constructing broadcast trees for real-time traffic with delay constraint...
AbstractWe present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with v...
We consider the problem of constructing a multicast tree that connects a group of source nodes to ...
Abstract. The problem of minimizing the maximum edge conges-tion in a multicast communication networ...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...