Universal framework for wireless scheduling problems

DOI10.4230/LIPICS.ICALP.2017.129MaRDI QIDQ5111461zbMATH OpenFDO

Authors Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Tigran Tonoyan

Publication date 27 May 2020

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

zbMATH Keywords

approximation frameworkphysical modelwireless scheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Effective Wireless Scheduling via Hypergraph Sketches
• Wireless scheduling with power control
• Limitations of current wireless link scheduling algorithms
• Wireless Scheduling with Power Control
• Efficiency of wireless networks: approximation algorithms for the physical interference model

Cited in

(8)

• Universal stability in multi-hop radio networks
• Computing inductive vertex orderings
• Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
• Reconfiguration of colorable sets in classes of perfect graphs
• Wireless Communication Is in APX
• Reconfiguration of Colorable Sets in Classes of Perfect Graphs
• Effective Wireless Scheduling via Hypergraph Sketches
• Generalized disk graphs

This page was built for publication: Universal framework for wireless scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111461)