Approximation algorithms in graphs with known broadcast time of the base graph
From MaRDI portal
Publication:6102286
DOI10.1007/978-3-030-95018-7_24OpenAlexW4206978675MaRDI QIDQ6102286
Hovhannes A. Harutyunyan, Puspal Bhabak
Publication date: 8 May 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-95018-7_24
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum broadcast time problem for several processor networks
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
- On broadcasting in unicyclic graphs
- Methods and problems of communication in usual networks
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Broadcast Problem in Hypercube of Trees
- Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
- Linear Algorithm for Broadcasting in Unicyclic Graphs
- A survey of gossiping and broadcasting in communication networks
- Information Dissemination in Trees
- Approximation Algorithms for Minimum-Time Broadcast
This page was built for publication: Approximation algorithms in graphs with known broadcast time of the base graph
