How Well Can Graphs Represent Wireless Interference?
From MaRDI portal
Publication:2941559
DOI10.1145/2746539.2746585zbMath1321.68023arXiv1411.1263OpenAlexW1998893700MaRDI QIDQ2941559
Tigran Tonoyan, Magnús M. Halldórsson
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.1263
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)
Related Items (9)
Connectivity of soft random geometric graphs over annuli ⋮ Generalized disk graphs ⋮ Mean-Field Limits for Large-Scale Random-Access Networks ⋮ Network design under general wireless interference ⋮ Limitations of current wireless link scheduling algorithms ⋮ Spanning Trees With Edge Conflicts and Wireless Connectivity ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review ⋮ The Power of Oblivious Wireless Power
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: How Well Can Graphs Represent Wireless Interference?
