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.68261OpenAlexW84305015MaRDI QIDQ3637083

Randy Goebel, Guo-Hui Lin, Zhipeng Cai

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 algorithmtree partitioningcapacitated multicast tree routing

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Balanced tree partition problems with virtual nodes

This page was built for publication: Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem