Improved approximation algorithms for the Capacitated Multicast Routing Problem

Zhipeng Cai, Guohui Lin, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

69 Scopus citations

Abstract

Two models for the Capacitated Multicast Routing Problem are considered, which are the Multicast k-Path Routing and the Multicast k-Tree Routing. Under these models, two improved approximation algorithms are presented, which have worst case performance ratios of 3 and (2 + ρ), respectively. Here ρ denotes the best approximation ratio for the Steiner Minimum Tree problem, and it is about 1.55 at the writing of the paper. The two approximation algorithms improve upon the previous best ones having performance ratios of 4 and (2.4 + ρ), respectively. The designing techniques developed in the paper could be applicable to other similar networking problems.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
EditorsL. Wang
Pages136-145
Number of pages10
Volume3595
Publication statusPublished - 2005
Event11th Annual International Conference on Computing and Combinatorics, COCOON 2005 - Kunming, China
Duration: Aug 16 2005Aug 29 2005

Other

Other11th Annual International Conference on Computing and Combinatorics, COCOON 2005
CountryChina
CityKunming
Period8/16/058/29/05

    Fingerprint

Keywords

  • Approximation Algorithm
  • Capacitated Multicast Routing
  • Steiner Minimum Tree
  • Tree Partitioning

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Cai, Z., Lin, G., & Xue, G. (2005). Improved approximation algorithms for the Capacitated Multicast Routing Problem. In L. Wang (Ed.), Lecture Notes in Computer Science (Vol. 3595, pp. 136-145)