An improved approximation algorithm for capacitated multicast routings in networks

DOI10.1016/J.TCS.2007.10.021MaRDI QIDQ2474074zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmgraph algorithmnetwork optimizationtree covermulticast routing problem

Mathematics Subject Classification ID

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

Recommendations

• Computing and Combinatorics
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• An improved approximation algorithm for multicast \(k\)-tree routing
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• Approximating capacitated tree-routings in networks
• Approximating Capacitated Tree-Routings in Networks
• Approximation algorithms for multicast routing in ad hoc wireless networks
• Experimental and Efficient Algorithms
• A survey of combinatorial optimization problems in multicast routing
• scientific article; zbMATH DE number 484567

Cites work

• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• Algorithms for multicast connection under multi-path routing model.
• An improved approximation algorithm for multicast \(k\)-tree routing
• Automata, Languages and Programming
• Computing and Combinatorics
• Routing algorithm for multicast under multi-tree model in optical networks

Cited in

(12)

• An improved approximation algorithm for multicast \(k\)-tree routing
• A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
• Computing and Combinatorics
• A survey of combinatorial optimization problems in multicast routing
• On the approximation of the generalized capacitated tree-routing problem
• Size-constrained tree partitioning: approximating the multicast k-tree routing problem
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• The \((K, k)\)-capacitated spanning tree problem
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• scientific article; zbMATH DE number 484567 (Why is no real title available?)
• Approximating capacitated tree-routings in networks
• Approximating the Generalized Capacitated Tree-Routing Problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474074)