Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem

DOI10.1007/978-3-642-02026-1_34zbMath1246.68261MaRDI QIDQ3637083

Guo-Hui Lin, Zhipeng Cai, Randy Goebel

Publication date: 7 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_34

zbMATH Keywords

approximation algorithm; tree partitioning; capacitated multicast tree routing

Mathematics Subject Classification ID

90B18: Communication networks in operations research

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms