On approximating the memory-constrained module allocation problem (Q286996)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6585378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximating the memory-constrained module allocation problem |
scientific article; zbMATH DE number 6585378 |
Statements
On approximating the memory-constrained module allocation problem (English)
0 references
26 May 2016
0 references
computational complexity
0 references
combinatorial problems
0 references
distributed systems
0 references
polynomial-time approximation algorithms
0 references
0.8632823
0 references
0.8572928
0 references
0.85341144
0 references
0.85158885
0 references
0.8484384
0 references
0.84708965
0 references
0.8466729
0 references
0.84284306
0 references
0.84283483
0 references
