An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
From MaRDI portal
Publication:5505667
DOI10.1007/978-3-540-85097-7_27zbMath1168.90627OpenAlexW1556245316MaRDI QIDQ5505667
Lusheng Wang, Zhipeng Cai, Zhi-Zhong Chen, Guo-Hui Lin
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (9)
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: approximating the multicast \(k\)-tree routing problem ⋮ Balanced tree partition problems with virtual nodes ⋮ DOAMI: a distributed on-line algorithm to minimize interference for routing in wireless sensor networks ⋮ On multi-path routing for reliable communications in failure interdependent complex networks ⋮ On the approximation of the generalized capacitated tree-routing problem ⋮ A 3.4713-approximation algorithm for the capacitated multicast tree routing problem ⋮ An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
Cites Work
- Unnamed Item
- Algorithms for multicast connection under multi-path routing model.
- Routing algorithm for multicast under multi-tree model in optical networks
- An improved approximation algorithm for capacitated multicast routings in networks
- An improved approximation algorithm for multicast \(k\)-tree routing
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- Computing and Combinatorics
This page was built for publication: An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem