An improved approximation algorithm for multicast \(k\)-tree routing

DOI10.1007/s10878-005-1776-xzbMath1093.90017OpenAlexW2081831441MaRDI QIDQ2576773

Guo-Hui Lin

Publication date: 14 December 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-1776-x

zbMATH Keywords

approximation algorithmSteiner minimum treetree partitioningweight averaging

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (8)

Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem ⋮ Approximating capacitated tree-routings in networks ⋮ Shape Measures of Random Increasing k-trees ⋮ An improved approximation algorithm for capacitated multicast routings in networks ⋮ On the approximation of the generalized capacitated tree-routing problem ⋮ Packing trees in communication networks ⋮ 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

• Algorithms for multicast connection under multi-path routing model.
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved approximation algorithm for multicast \(k\)-tree routing