Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68555OpenAlexW4376561447MaRDI QIDQ5716931

Guoliang Xue, Guo-Hui Lin, 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)

Related Items

OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks ⋮ Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks ⋮ \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks ⋮ Approximate event detection over multi-modal sensing data ⋮ Efficient accuracy evaluation for multi-modal sensed data ⋮ Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks ⋮ Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem ⋮ Balanced tree partition problems with virtual nodes ⋮ DOAMI: a distributed on-line algorithm to minimize interference for routing in wireless sensor networks ⋮ Approximating the Generalized Capacitated Tree-Routing Problem ⋮ Approximating capacitated tree-routings in networks ⋮ Neighborhood-based uncertainty generation in social networks ⋮ An improved approximation algorithm for capacitated multicast routings in networks ⋮ On multi-path routing for reliable communications in failure interdependent complex 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