An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

DOI10.1007/978-3-540-85097-7_27MaRDI QIDQ5505667zbMATH OpenOpenAlexFDO

Authors Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang

Publication date 27 January 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85097-7_27

zbMATH Keywords

approximation algorithmcapacitated multicast tree routingSteiner minimum treetree partitioning

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Computing and Combinatorics
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• An improved approximation algorithm for multicast \(k\)-tree routing
• An improved approximation algorithm for capacitated multicast routings in networks
• Size-constrained tree partitioning: approximating the multicast k-tree routing problem

Cites work

• Algorithms for multicast connection under multi-path routing model.
• An improved approximation algorithm for capacitated multicast routings in networks
• An improved approximation algorithm for multicast \(k\)-tree routing
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• Computing and Combinatorics
• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• Routing algorithm for multicast under multi-tree model in optical networks

Cited in

(19)

• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
• On multi-path routing for reliable communications in failure interdependent complex networks
• Balanced tree partition problems with virtual nodes
• DOAMI: a distributed on-line algorithm to minimize interference for routing in wireless sensor networks
• An improved approximation algorithm for capacitated multicast routings in networks
• Improved approximation algorithms for the quality of service multicast tree problem
• An improved approximation algorithm for multicast \(k\)-tree routing
• An approximation for minimum multicast route in optical networks with nonsplitting nodes
• OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
• Metric and distributed on-line algorithm for minimizing routing interference in wireless sensor networks
• Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
• scientific article; zbMATH DE number 1990677 (Why is no real title available?)
• Approximating Capacitated Tree-Routings in Networks
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• Computing and Combinatorics
• Bandwidth maximization in multicasting
• Size-constrained tree partitioning: approximating the multicast k-tree routing problem
• On the approximation of the generalized capacitated tree-routing problem

This page was built for publication: An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505667)