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 Citations (Scopus)

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
StatePublished - 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

Approximation algorithms

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)

Improved approximation algorithms for the Capacitated Multicast Routing Problem. / Cai, Zhipeng; Lin, Guohui; Xue, Guoliang.

Lecture Notes in Computer Science. ed. / L. Wang. Vol. 3595 2005. p. 136-145.

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

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, 11th Annual International Conference on Computing and Combinatorics, COCOON 2005, Kunming, China, 8/16/05.
Cai Z, Lin G, Xue G. Improved approximation algorithms for the Capacitated Multicast Routing Problem. In Wang L, editor, Lecture Notes in Computer Science. Vol. 3595. 2005. p. 136-145
Cai, Zhipeng ; Lin, Guohui ; Xue, Guoliang. / Improved approximation algorithms for the Capacitated Multicast Routing Problem. Lecture Notes in Computer Science. editor / L. Wang. Vol. 3595 2005. pp. 136-145
@inproceedings{4d0cb94bdf63423d8a320075b237cec6,
title = "Improved approximation algorithms for the Capacitated Multicast Routing Problem",
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.",
keywords = "Approximation Algorithm, Capacitated Multicast Routing, Steiner Minimum Tree, Tree Partitioning",
author = "Zhipeng Cai and Guohui Lin and Guoliang Xue",
year = "2005",
language = "English (US)",
volume = "3595",
pages = "136--145",
editor = "L. Wang",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Improved approximation algorithms for the Capacitated Multicast Routing Problem

AU - Cai, Zhipeng

AU - Lin, Guohui

AU - Xue, Guoliang

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Approximation Algorithm

KW - Capacitated Multicast Routing

KW - Steiner Minimum Tree

KW - Tree Partitioning

UR - http://www.scopus.com/inward/record.url?scp=26844457943&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844457943&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:26844457943

VL - 3595

SP - 136

EP - 145

BT - Lecture Notes in Computer Science

A2 - Wang, L.

ER -