scientific article; zbMATH DE number 7053296

zbMath1421.68133arXiv1110.0938MaRDI QIDQ5743417

Magnús M. Halldórsson, Pradipta Mitra

Publication date: 10 May 2019

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

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Connectivity (05C40) Communication theory (94A05)

Related Items (9)

Network design under general wireless interference ⋮ Leveraging multiple channels in ad hoc networks ⋮ Radio aggregation scheduling ⋮ Limitations of current wireless link scheduling algorithms ⋮ Spanning Trees With Edge Conflicts and Wireless Connectivity ⋮ A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model ⋮ Fault-Tolerant Consensus with an Abstract MAC Layer. ⋮ Effective Wireless Scheduling via Hypergraph Sketches ⋮ The Power of Oblivious Wireless Power

Cites Work

• Unnamed Item
• Unnamed Item
• Wireless scheduling with power control
• Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
• The price of being near-sighted
• Distributed Contention Resolution in Wireless Networks
• Connectivity Problem in Wireless Networks
• Wireless Communication Is in APX
• The capacity of wireless networks
• Oblivious interference scheduling
• The topology of wireless communication

This page was built for publication: