Distributed approximation of cellular coverage
type: Item
instance of: scholarly article
title: Distributed approximation of cellular coverage
zbMATH Open document ID: 1242.68025
author: Boaz Patt-Shamir
author: Dror Rawitz
author: Gabriel Scalosub
published in: Journal of Parallel and Distributed Computing
publication date: 2012-07-13T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6055974
zbMATH Keywords: distributed algorithms
zbMATH Keywords: cellular networks
zbMATH Keywords: assignment problem
MaRDI profile type: Publication
full work available at URL: j.jpdc.2011.12.003
OpenAlex ID: W2044578110
cites work: Coping with Interference: From Maximum Coverage to Planning Cellular Networks
cites work: A unified approach to approximating resource allocation and scheduling
cites work: Q3221758
cites work: On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
cites work: Q4952619
cites work: An efficient approximation for the generalized assignment problem
cites work: Approximation algorithms for the multiple knapsack problem with assignment restrictions
cites work: Improved Distributed Approximate Matching
cites work: Fast primal-dual distributed algorithms for scheduling and matching problems
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: A log-star distributed maximal independent set algorithm for growth-bounded graphs
cites work: An approximation algorithm for the generalized assignment problem
DOI: 10.1016/J.JPDC.2011.12.003
description: scientific article; zbMATH DE number 6055974