Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs (Q5452164)
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: Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs |
scientific article; zbMATH DE number 5252762
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs |
scientific article; zbMATH DE number 5252762 |
Statements
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs (English)
0 references
25 March 2008
0 references
Inverse combinatorial optimization
0 references
Inverse chromatic number problem
0 references
Interval graphs
0 references
Machine(s)-scheduling with earliness and or tardiness costs
0 references
NP-hardness
0 references
Approximation
0 references
0.92532384
0 references
0.8958341
0 references
0.85741293
0 references
0.84071636
0 references
0.8372612
0 references
0.83627903
0 references
0.8319746
0 references
0 references
