The online broadcast range-assignment problem

DOI10.1007/s00453-023-01166-4OpenAlexW3090797528MaRDI QIDQ6088305

Aleksandar Markovic, Seeun William Umboh, Mark T. de Berg

Publication date: 13 December 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-023-01166-4

zbMATH Keywords

online algorithmscomputational geometrybroadcastrange assignment

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• The minimum range assignment problem on linear radio networks
• Power consumption in packet radio networks
• Online dominating set
• Improved methods for approximating node weighted Steiner trees and connected dominating sets.
• Minimum-energy broadcasting in static ad hoc wireless networks
• The minimum broadcast range assignment problem on linear multi-hop wireless networks.
• Approximate Min-Power Strong Connectivity
• On Min-Power Steiner Tree
• On the hardness of range assignment problems
• The Online Set Cover Problem
• STACS 2004

This page was built for publication: The online broadcast range-assignment problem