Issue No.11 - November (2007 vol.56)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.1046
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.
Inapproximability, inter-destination delay variation, multicast routing, NP-complete, NP-hard
Pi-Rong Sheu, "On the Hardness of Approximating the Multicast Delay Variation Problem", IEEE Transactions on Computers, vol.56, no. 11, pp. 1575-1577, November 2007, doi:10.1109/TC.2007.1046