AbstractWe present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with various time-delay constraints. We study the spanning forest problem with bandwidth constraint. A polynomial-time algorithm is given. Those problems have applications in network communications
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
We give a multicast tree construction method for delay-sensitive applications by first trying to com...
We address a variant of the Steiner tree problem for delay constrained problems. The addressed probl...
AbstractWe present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with v...
Most network-based multimedia applications require multicasting with constraints such as bandwidth a...
We consider a problem of cost-constrained minimum-delay multicasting in a network, which is to find ...
This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical St...
Abstract. We consider a problem of cost-constrained minimum-delay multicasting in a network, which i...
This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical St...
This paper is concerned with developing novel algorithms for multicast routing in packet switched co...
This paper is concerned with developing novel algorithms for multicast routing in packet switched co...
In order to optimize cost and decrease complexity with a delay upper bound, the delay-constrained St...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
ABSTRACT The Distributed multicast routing protocol under delay constraints, is one of the software...
We formulate the problem of constructing broadcast trees for real-time traffic with delay constraint...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
We give a multicast tree construction method for delay-sensitive applications by first trying to com...
We address a variant of the Steiner tree problem for delay constrained problems. The addressed probl...
AbstractWe present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with v...
Most network-based multimedia applications require multicasting with constraints such as bandwidth a...
We consider a problem of cost-constrained minimum-delay multicasting in a network, which is to find ...
This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical St...
Abstract. We consider a problem of cost-constrained minimum-delay multicasting in a network, which i...
This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical St...
This paper is concerned with developing novel algorithms for multicast routing in packet switched co...
This paper is concerned with developing novel algorithms for multicast routing in packet switched co...
In order to optimize cost and decrease complexity with a delay upper bound, the delay-constrained St...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
ABSTRACT The Distributed multicast routing protocol under delay constraints, is one of the software...
We formulate the problem of constructing broadcast trees for real-time traffic with delay constraint...
In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding op...
We give a multicast tree construction method for delay-sensitive applications by first trying to com...
We address a variant of the Steiner tree problem for delay constrained problems. The addressed probl...
DOI
Add to ORKG
