A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies (Q5361827): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:26, 9 February 2024
scientific article; zbMATH DE number 6784068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies |
scientific article; zbMATH DE number 6784068 |
Statements
A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies (English)
0 references
29 September 2017
0 references
scheduling
0 references
approximation algorithms
0 references
hierarchies
0 references
linear programming relaxations
0 references
