The Bandwidth Allocation Problem in the ATM network model is NP-complete (Q293234)
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: The Bandwidth Allocation Problem in the ATM network model is NP-complete |
scientific article; zbMATH DE number 6590686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Bandwidth Allocation Problem in the ATM network model is NP-complete |
scientific article; zbMATH DE number 6590686 |
Statements
The Bandwidth Allocation Problem in the ATM network model is NP-complete (English)
0 references
9 June 2016
0 references
ATM
0 references
NP-complete
0 references
genetic algorithms
0 references
computational complexity
0 references
0.7449069619178772
0 references
0.7378309965133667
0 references
0.7285072207450867
0 references
0.7272771596908569
0 references
0.7223932147026062
0 references
