A note on line broadcast in digraphs under the edge-disjoint paths mode

DOI10.1016/j.dam.2003.11.009zbMath1088.68674OpenAlexW2001432254MaRDI QIDQ1765240

Pierre Fraigniaud

Publication date: 23 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.11.009

zbMATH Keywords

Interconnection networkMulticasting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• Methods and problems of communication in usual networks
• Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings
• Polynomial-time algorithms for minimum-time broadcast in trees
• A threshold of ln n for approximating set cover
• Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
• A survey of gossiping and broadcasting in communication networks
• Minimum-time line broadcast networks
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• Linear broadcast routing
• New models and algorithms for future networks
• Approximation Algorithms for Minimum-Time Broadcast
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on line broadcast in digraphs under the edge-disjoint paths mode