``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654)
From MaRDI portal
!
WARNING
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 5781868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation |
scientific article; zbMATH DE number 5781868 |
Statements
``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (English)
0 references
9 September 2010
0 references
complexity theory
0 references
scheduling
0 references
subset product
0 references
FPTAS
0 references
systems reliability
0 references
0 references
0.9049323797225952
0 references
0.7658630609512329
0 references
0.7568358778953552
0 references
0.754397451877594
0 references
