Wireless capacity with arbitrary gain matrix
type: Item
instance of: scholarly article
title: Wireless capacity with arbitrary gain matrix
zbMATH Open document ID: 1360.68153
author: Magnús M. Halldórsson
author: Pradipta Mitra
published in: Theoretical Computer Science
publication date: 2014-09-18T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6345743
zbMATH Keywords: wireless networks
zbMATH Keywords: SINR model
zbMATH Keywords: semidefinite programming
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: j.tcs.2013.09.035
OpenAlex ID: W2076403558
cites work: Wireless Communication Is in APX
cites work: Oblivious interference scheduling
cites work: Distributed Contention Resolution in Wireless Networks
cites work: Q5365137
cites work: Q5365138
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Coloring -colorable graphs using relatively small palettes
cites work: Approximate graph coloring by semidefinite programming
cites work: Q4952635
cites work: A better approximation ratio for the vertex cover problem
cites work: Approximating coloring and maximum independent sets in 3-uniform hypergraphs
cites work: Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
cites work: The topology of wireless communication
cites work: Nearly optimal bounds for distributed wireless scheduling in the SINR model
cites work: Convergence Time of Power-Control Dynamics
cites work: Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
cites work: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
cites work: Semidefinite Programming
DOI: 10.1016/J.TCS.2013.09.035
description: scientific article; zbMATH DE number 6345743