A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies (Q5361827): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2412957665 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1509.07808 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:27, 20 April 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
