Improved approximation algorithms for the capacitated multicast routing problem

DOI10.1007/11533719_16MaRDI QIDQ5716931zbMATH OpenOpenAlexFDO

Authors Guohui Lin, Guoliang Xue, Zhipeng Cai

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719

zbMATH Keywords

Approximation AlgorithmCapacitated Multicast RoutingSteiner Minimum TreeTree Partitioning

Mathematics Subject Classification ID

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

Recommendations

• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• An improved approximation algorithm for multicast \(k\)-tree routing
• An improved approximation algorithm for capacitated multicast routings in networks
• Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem

Cited in

(27)

• Packing trees in communication networks
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks
• On multi-path routing for reliable communications in failure interdependent complex networks
• A survey of combinatorial optimization problems in multicast routing
• Balanced tree partition problems with virtual nodes
• DOAMI: a distributed on-line algorithm to minimize interference for routing in wireless sensor networks
• An improved approximation algorithm for capacitated multicast routings in networks
• Improved approximation algorithms for the quality of service multicast tree problem
• An improved approximation algorithm for multicast \(k\)-tree routing
• An approximation for minimum multicast route in optical networks with nonsplitting nodes
• OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
• Approximate aggregation for tracking quantiles in wireless sensor networks
• (, )-monitoring for event detection in wireless sensor networks
• Approximate event detection over multi-modal sensing data
• Efficient accuracy evaluation for multi-modal sensed data
• Metric and distributed on-line algorithm for minimizing routing interference in wireless sensor networks
• Approximating the Generalized Capacitated Tree-Routing Problem
• A 1.6 Approximation Algorithm for Routing Multiterminal Nets
• Fast approximation of minimum multicast congestion -- implementation versus theory
• Neighborhood-based uncertainty generation in social networks
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
• Implementation of approximation algorithms for the multicast congestion problem
• Size-constrained tree partitioning: approximating the multicast k-tree routing problem
• Approximating capacitated tree-routings in networks
• On the approximation of the generalized capacitated tree-routing problem

This page was built for publication: Improved approximation algorithms for the capacitated multicast routing problem

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