Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem

DOI10.1016/J.TCS.2009.05.031zbMath1207.68029OpenAlexW2068568045MaRDI QIDQ621842

Zhipeng Cai, Randy Goebel, Guo-Hui Lin

Publication date: 28 January 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.031

zbMATH Keywords

approximation algorithmtree partitioningcapacitated multicast tree routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items (6)

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 ⋮ \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks ⋮ 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

Cites Work

• Unnamed Item
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• 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
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• Routing to Multiple Destinations in Computer Networks
• Automata, Languages and Programming
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• Computing and Combinatorics

This page was built for publication: Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem