Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/b99805zbMath1105.68308OpenAlexW4301133941MaRDI QIDQ5313020

Andrzej Pelc, Dariusz R. Kowalski

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (10)

Time efficient centralized gossiping in radio networks ⋮ Time efficient \(k\)-shot broadcasting in known topology radio networks ⋮ Information dissemination in unknown radio networks with large labels ⋮ Faster communication in known topology radio networks ⋮ Broadcasting in geometric radio networks ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks ⋮ Deterministic M2M multicast in radio networks ⋮ A note on the lower bound of centralized radio broadcasting for planar reachability graphs ⋮ Time-Efficient Broadcast in Radio Networks

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques