A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies (Q5361827)
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 6784068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9971295595169068
0 references
0.919371485710144
0 references
0.8002710342407227
0 references
0.791670024394989
0 references
