On approximating a scheduling problem (Q5952318)
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 1688723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximating a scheduling problem |
scientific article; zbMATH DE number 1688723 |
Statements
On approximating a scheduling problem (English)
0 references
2001
0 references
parallel computation
0 references
communication
0 references
bipartite graph
0 references
edge coloring
0 references
0.998215913772583
0 references
0.8145164847373962
0 references
0.8135600090026855
0 references
0.8031212091445923
0 references
