Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates

DOI10.1007/978-3-642-33090-2_57zbMath1365.68124arXiv1205.1331OpenAlexW1957027869MaRDI QIDQ2912883

Thomas Kesselheim

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (8)

Nearly optimal bounds for distributed wireless scheduling in the SINR model ⋮ Network design under general wireless interference ⋮ Limitations of current wireless link scheduling algorithms ⋮ Spanning Trees With Edge Conflicts and Wireless Connectivity ⋮ Wireless capacity with arbitrary gain matrix ⋮ Comparative study of approximation algorithms and heuristics for SINR scheduling with power control ⋮ Effective Wireless Scheduling via Hypergraph Sketches ⋮ The Power of Oblivious Wireless Power

This page was built for publication: Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates