Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (Q1128739): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(97)00209-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088390443 / rank | |||
Normal rank | |||
Latest revision as of 11:23, 30 July 2024
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
