Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906)
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: Fixed interval scheduling: models, applications, computational complexity and algorithms |
scientific article; zbMATH DE number 5117698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fixed interval scheduling: models, applications, computational complexity and algorithms |
scientific article; zbMATH DE number 5117698 |
Statements
Fixed interval scheduling: models, applications, computational complexity and algorithms (English)
0 references
22 January 2007
0 references
binterval scheduling
0 references
interval graph
0 references
\(k\)-coloring
0 references
\(k\)-track assignment
0 references
discrete starting times
0 references
maximum weight clique
0 references
maximum weight independent set
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8598335385322571
0 references
0.8430766463279724
0 references
0.8412008285522461
0 references
0.839259684085846
0 references
0.8386147022247314
0 references
