Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (Q1128739)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Affine scheduling on bounded convex polyhedric domains is asymptotically optimal |
scientific article |
Statements
Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (English)
0 references
13 August 1998
0 references
automatic parallelization
0 references
longest path in a graph
0 references
linear programming
0 references
