By Topic

On the Hardness of Approximating the Multicast Delay Variation Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pi-Rong Sheu ; Nat. Yunlin Univ. of Sci. & Technol., Touliu ; Shan-Tai Chen

Given a network with one source and multiple destinations, the multicast delay variation problem attempts to construct a multicast tree such that the interdestination 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 interdestination delay variation constraint unless NP = P.

Published in:

IEEE Transactions on Computers  (Volume:56 ,  Issue: 11 )