Distributed approximation of cellular coverage

DOI10.1016/J.JPDC.2011.12.003zbMath1242.68025OpenAlexW2044578110MaRDI QIDQ433421

Dror Rawitz, Gabriel Scalosub, Boaz Patt-Shamir

Publication date: 13 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.12.003

zbMATH Keywords

assignment problemdistributed algorithmscellular networks

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (4)

Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ Distributed approximation of \(k\)-service assignment ⋮ Distributed backup placement in networks ⋮ Flexible allocation on related machines with assignment restrictions

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient approximation for the generalized assignment problem
• An approximation algorithm for the generalized assignment problem
• Approximation algorithms for the multiple knapsack problem with assignment restrictions
• Fast primal-dual distributed algorithms for scheduling and matching problems
• A log-star distributed maximal independent set algorithm for growth-bounded graphs
• Improved Distributed Approximate Matching
• Distributed Computing: A Locality-Sensitive Approach
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Distributed approximation of cellular coverage