Bandwidth allocation in cellular networks with multiple interferences

DOI10.1016/j.dam.2015.05.013zbMath1366.90033OpenAlexW869726442MaRDI QIDQ494422

Dror Rawitz, Gleb Polevoy, Reuven Bar Yehuda

Publication date: 1 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.013

zbMATH Keywords

interval selectionapproximation algorithmsbandwidth allocationinterval schedulinglocal ratiomultiple interferences

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (2)

Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of bandwidth allocation in radio networks
• Algorithms for next generation networks
• On the approximability of an interval scheduling problem
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem
• The approximation of maximum subgraph problems
• Reducibility among Combinatorial Problems
• Fundamentals of Wireless Communication
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Bandwidth allocation in cellular networks with multiple interferences