Network design under general wireless interference

DOI10.1007/s00453-021-00866-zOpenAlexW3193190408MaRDI QIDQ2665910

Pradipta Mitra, Guy Kortsarz, Tigran Tonoyan, Magnús M. Halldórsson

Publication date: 19 November 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00866-z

zbMATH Keywords

schedulingconnectivitynetwork designwireless interference

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Nearly optimal bounds for distributed wireless scheduling in the SINR model
• Approximation algorithms for combinatorial problems
• Zero knowledge and the chromatic number
• Radio aggregation scheduling
• Computing inductive vertex orderings
• Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
• Wireless scheduling with power control
• Dynamic packet scheduling in wireless networks
• How Well Can Graphs Represent Wireless Interference?
• Beyond geometry
• Elimination graphs
• Distributed Contention Resolution in Wireless Networks
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• The capacity of wireless networks
• Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems
• Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
• Oblivious interference scheduling
• Broadcasting in unreliable radio networks
• Maximal independent sets in radio networks
• The Power of Oblivious Wireless Power
• The Price of Local Power Control in Wireless Scheduling
• Fundamentals of Wireless Communication
• Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks

This page was built for publication: Network design under general wireless interference