The minimum range assignment problem on linear radio networks

DOI10.1007/s00453-002-0985-2zbMath1051.68151OpenAlexW2150852281MaRDI QIDQ1566370

Andrea E. F. Clementi, Riccardo Silvestri, Paolo Penna, Stéphane Pérennes, Afonso G. Ferreira

Publication date: 2 June 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0985-2

zbMATH Keywords

Dynamic programmingApproximation algorithmsAd hoc packet radio networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (9)

Range assignment for energy efficient broadcasting in linear radio networks ⋮ IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS ⋮ The online broadcast range-assignment problem ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ The Online Broadcast Range-Assignment Problem ⋮ Bounded-hop communication networks ⋮ Weighted broadcast in linear radio networks ⋮ Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems ⋮ On the approximability of the range assignment problem on radio networks in presence of selfish agents

This page was built for publication: The minimum range assignment problem on linear radio networks