Worst-case analysis of a dynamic channel assignment strategy (Q1827841)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Worst-case analysis of a dynamic channel assignment strategy |
scientific article; zbMATH DE number 2083773
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of a dynamic channel assignment strategy |
scientific article; zbMATH DE number 2083773 |
Statements
Worst-case analysis of a dynamic channel assignment strategy (English)
0 references
6 August 2004
0 references
Cellular networks
0 references
Graph multicoloring
0 references
NP-completeness
0 references
Approximation algorithms
0 references
Greedy algorithms
0 references
Worst-case analysis
0 references
Channel assignment
0 references
