STACS 2004
From MaRDI portal
Publication:5309719
DOI10.1007/b96012zbMath1122.68328OpenAlexW4236485840MaRDI QIDQ5309719
Angelo Monti, Nissan Lev-Tov, Miriam Di Ianni, Gianluca Rossi, Riccardo Silvestri, Christoph Ambühl, David Peleg, Andrea E. F. Clementi
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Related Items (11)
On the bounded-hop MST problem on random Euclidean instances ⋮ Parameterized complexity of Min-power multicast problems in wireless ad hoc networks ⋮ The homogeneous broadcast problem in narrow and wide strips. I: Algorithms ⋮ The online broadcast range-assignment problem ⋮ Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges ⋮ The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View ⋮ The Online Broadcast Range-Assignment Problem ⋮ Weighted broadcast in linear radio networks ⋮ Bounded-hops power assignment in ad hoc wireless networks ⋮ Time-Efficient Broadcast in Radio Networks ⋮ Homogeneous 2-hop broadcast in 2D
This page was built for publication: STACS 2004
