A polynomial time approximation algorithm for dynamic storage allocation (Q1176726): 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:24, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time approximation algorithm for dynamic storage allocation |
scientific article |
Statements
A polynomial time approximation algorithm for dynamic storage allocation (English)
0 references
25 June 1992
0 references
The NP-complete problem Dynamic Storage Allocation may be phrased in terms of `weighted' colourings of weighted interval graphs. It is shown how an on-line algorithm for colouring interval graphs (which is a modification of an algorithm of Kierstead and Trotter) may be used to construct a polynomial time approximation algorithm for the Dynamic Storage Allocation problem. The performance ratio is at most 6; the best previously known performance ratio for such an algorithm had been 80.
0 references
approximation algorithm
0 references
dynamic storage allocation
0 references
interval graphs
0 references
colourings
0 references
