scientific article; zbMATH DE number 2089983

zbMath1077.90513MaRDI QIDQ4808648

Tomasz Jurdziński, Mirosław Kutyłowski, J. Zatopiański

Publication date: 12 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2387/23870279.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (14)

Quasi-optimal energy-efficient leader election algorithms in radio networks ⋮ Node and edge averaged complexities of local graph problems ⋮ Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ Distributed MIS with Low Energy and Time Complexities ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Monitoring churn in wireless networks ⋮ Energy efficient alert in single-hop networks of extremely weak devices ⋮ Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards ⋮ Fast size approximation of a radio network in beeping model ⋮ Approximate Neighbor Counting in Radio Networks ⋮ Approximating the Size of a Radio Network in Beeping Model ⋮ Efficient and competitive broadcast in multi-channel radio networks

This page was built for publication: