The Online Broadcast Range-Assignment Problem

DOI10.4230/lipics.isaac.2020.60arXiv2009.14473OpenAlexW3117359896MaRDI QIDQ6065469

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

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/2009.14473

zbMATH Keywords

online algorithmscomputational geometrybroadcastrange assignment

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem

Cites Work

• 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