Effective Wireless Scheduling via Hypergraph Sketches

DOI10.1137/19M1275085OpenAlexW3153295604MaRDI QIDQ5858652

Tigran Tonoyan, Magnús M. Halldórsson

Publication date: 14 April 2021

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

schedulingwireless networkSINR modelconflict graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly optimal bounds for distributed wireless scheduling in the SINR model
• Online capacity maximization in wireless networks
• Approximation algorithms for intersection graphs
• Improved algorithms for latency minimization in wireless networks
• Zero knowledge and the chromatic number
• Coloring inductive graphs on-line
• Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
• Lectures on analysis on metric spaces
• Contention resolution on a fading channel
• Limitations of current wireless link scheduling algorithms
• Vertex coloring edge-weighted digraphs
• Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
• Wireless scheduling with power control
• Dynamic packet scheduling in wireless networks
• Beyond geometry
• Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling
• Elimination graphs
• Distributed Contention Resolution in Wireless Networks
• The capacity of wireless networks
• Jamming-Resistant Learning in Wireless Networks
• Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
• The Power of Oblivious Wireless Power
• Hardness of Low Delay Network Scheduling
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• On Some Bounds on the Optimum Schedule Length in the SINR Model

This page was built for publication: Effective Wireless Scheduling via Hypergraph Sketches