Computer Algorithms: C++
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Resource optimization in QoS multicast routing of real-time multimedia
IEEE/ACM Transactions on Networking (TON)
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Many-to-many multicast routing with temporal quality of service guarantees
IEEE Transactions on Computers
Distributed multicast routing, with end-to-end delay and delay variation constraints
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 14.98 |
Given a network with one source and multiple destinations, the multicast delay variation problem attempts to construct a multicast tree such that the inter-destination delay variation among all the paths from the source to each destination is minimized. In this paper, we show that the problem is NP-hard and that it is not approximable within a constant factor in polynomial time unless NP = P. These findings indicate that it is impossible to develop efficient optimal or approximation algorithms for any multicast routing problem under the inter-destination delay variation constraint unless NP = P.