Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 07:00, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate strong separation with application in fractional graph coloring and preemptive scheduling. |
scientific article |
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
