scientific article; zbMATH DE number 6783490

zbMath1373.68157arXiv1010.4249MaRDI QIDQ5365137

Magnús M. Halldórsson, Pradipta Mitra

Publication date: 29 September 2017

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

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

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)

Related Items

Nearly optimal bounds for distributed wireless scheduling in the SINR model ⋮ Batched Point Location in SINR Diagrams via Algebraic Tools ⋮ Distributed wireless link scheduling in the SINR model ⋮ Network design under general wireless interference ⋮ The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication ⋮ Conflict graphs and the SINR-capacity of the mean power scheme ⋮ The topology of wireless communication on a line ⋮ Limitations of current wireless link scheduling algorithms ⋮ Spanning Trees With Edge Conflicts and Wireless Connectivity ⋮ Convergence Time of Power-Control Dynamics ⋮ 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 ⋮ Unnamed Item ⋮ Vertex coloring edge-weighted digraphs ⋮ The Power of Oblivious Wireless Power

This page was built for publication: