An improved approximation algorithm for capacitated multicast routings in networks

DOI10.1016/j.tcs.2007.10.021zbMath1135.68064OpenAlexW1975490853MaRDI QIDQ2474074

Ehab Morsy, Hiroshi Nagamochi

Publication date: 5 March 2008

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

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

zbMATH Keywords

graph algorithmapproximation algorithmnetwork optimizationtree covermulticast routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items

The \((K, k)\)-capacitated spanning tree problem ⋮ Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem ⋮ Approximating the Generalized Capacitated Tree-Routing Problem ⋮ Approximating capacitated tree-routings in 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 multicast \(k\)-tree routing
• Automata, Languages and Programming
• Computing and Combinatorics

This page was built for publication: An improved approximation algorithm for capacitated multicast routings in networks