Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329)
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 1965346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate strong separation with application in fractional graph coloring and preemptive scheduling. |
scientific article; zbMATH DE number 1965346 |
Statements
Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (English)
0 references
17 August 2003
0 references
Approximation of separation
0 references
Optimization and violation
0 references
Fractional graph coloring
0 references
Preemptive scheduling
0 references
0 references
0 references
0 references
0.8104161620140076
0 references
