A polynomial time approximation algorithm for dynamic storage allocation (Q1176726): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Q200923 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Q593736 / rank | |||
Property / author | |||
Property / author: Henry A. Kierstead / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Colin J. H. McDiarmid / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some packing problem related to dynamic storage allocation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line and first fit colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3490014 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Linearity of First-Fit Coloring of Interval Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3950561 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Estimate of the Store Size Necessary for Dynamic Storage Allocation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Bay Restaurant--A Linear Storage Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Woodall's interval problem / rank | |||
Normal rank |
Latest revision as of 10:59, 15 May 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