On Some Bounds on the Optimum Schedule Length in the SINR Model

DOI10.1007/978-3-642-36092-3_14zbMath1351.68045OpenAlexW1036729261MaRDI QIDQ5507397

Tigran Tonoyan

Publication date: 19 December 2016

Published in: Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36092-3_14

Mathematics Subject Classification ID

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

Related Items (5)

Conflict graphs and the SINR-capacity of the mean power scheme ⋮ Limitations of current wireless link scheduling algorithms ⋮ Effective Wireless Scheduling via Hypergraph Sketches ⋮ Vertex coloring edge-weighted digraphs ⋮ The Power of Oblivious Wireless Power

This page was built for publication: On Some Bounds on the Optimum Schedule Length in the SINR Model