Cost-Constrained minimum-delay multicasting

Authors:
Satoshi Tayu;Turki Ghazi Al-Mutairi;Shuichi Ueno
Affiliations:
Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo, Japan;Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo, Japan;Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo, Japan
Venue:
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Year:
2005

Citing 9
Cited 0

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
K-pair delay constrained minimum cost routing in undirected networks

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for weight constrained Steiner trees in series-parallel graphs

Theoretical Computer Science
Algorithms for delay-constrained low-cost multicast tree construction

Computer Communications
QoS-driven multicast tree generation using Tabu search

Computer Communications
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We 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 $\mathcal{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.