On the complexity of bandwidth allocation in radio networks
type: Item
instance of: scholarly article
title: On the complexity of bandwidth allocation in radio networks
zbMATH Open document ID: 1217.68040
author: Ralf Klasing
author: Nelson Morales
author: Stéphane Pérennes
published in: Theoretical Computer Science
publication date: 2008-11-12T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5365089
zbMATH Keywords: bandwidth allocation
zbMATH Keywords: radio networks
zbMATH Keywords: approximation algorithms
zbMATH Keywords: steady state traffic
zbMATH Keywords: maximum concurrent flow
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.06.048
OpenAlex ID: W1980677244
cites work: Gathering Algorithms on Paths Under Interference Constraints
cites work: Q4079613
cites work: Unit disk graphs
cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
cites work: Zero knowledge and the chromatic number
cites work: Lower bounds on systolic gossip
cites work: Q5685113
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Geometric algorithms and combinatorial optimization.
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: The complexity of systolic dissemination of information in interconnection networks
cites work: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
cites work: Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
cites work: Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
cites work: An approximation algorithm for circular arc colouring
cites work: Fast approximation algorithms for multicommodity flow problems
cites work: A characterization of perfect graphs
cites work: The strong chromatic index ofC4-free graphs
cites work: The maximum concurrent flow problem
cites work: NP-completeness of some generalizations of the maximum matching problem
cites work: Fundamentals of Wireless Communication
cites work: Coloring a Family of Circular Arcs
DOI: 10.1016/J.TCS.2008.06.048
description: scientific article; zbMATH DE number 5365089