A polynomial time approximation algorithm for dynamic storage allocation

H. A. Kierstead

doi:10.1016/0012-365X(91)90011-P

A polynomial time approximation algorithm for dynamic storage allocation

H. A. Kierstead

Research output: Contribution to journal › Article › peer-review

64 Scopus citations

Abstract

We use an on-line algorithm for coloring interval graphs to construct a polynomial time approximation algorithm WIC for Dynamic Storage Allocation. The performance ratio for WIC is at most six; the best previous upper bound on the performance ratio for a polynomial time approximation algorithm for Dynamic Storage Allocation had been 80.

Original language	English (US)
Pages (from-to)	231-237
Number of pages	7
Journal	Discrete Mathematics
Volume	88
Issue number	2-3
DOIs	https://doi.org/10.1016/0012-365X(91)90011-P
State	Published - Apr 19 1991
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(91)90011-P

Cite this

@article{4eab3605623c4f69854d3bc6f15fd057,

title = "A polynomial time approximation algorithm for dynamic storage allocation",

abstract = "We use an on-line algorithm for coloring interval graphs to construct a polynomial time approximation algorithm WIC for Dynamic Storage Allocation. The performance ratio for WIC is at most six; the best previous upper bound on the performance ratio for a polynomial time approximation algorithm for Dynamic Storage Allocation had been 80.",

author = "Kierstead, {H. A.}",

year = "1991",

month = apr,

day = "19",

doi = "10.1016/0012-365X(91)90011-P",

language = "English (US)",

volume = "88",

pages = "231--237",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "2-3",

}

TY - JOUR

T1 - A polynomial time approximation algorithm for dynamic storage allocation

AU - Kierstead, H. A.

PY - 1991/4/19

Y1 - 1991/4/19

N2 - We use an on-line algorithm for coloring interval graphs to construct a polynomial time approximation algorithm WIC for Dynamic Storage Allocation. The performance ratio for WIC is at most six; the best previous upper bound on the performance ratio for a polynomial time approximation algorithm for Dynamic Storage Allocation had been 80.

AB - We use an on-line algorithm for coloring interval graphs to construct a polynomial time approximation algorithm WIC for Dynamic Storage Allocation. The performance ratio for WIC is at most six; the best previous upper bound on the performance ratio for a polynomial time approximation algorithm for Dynamic Storage Allocation had been 80.

UR - http://www.scopus.com/inward/record.url?scp=0005484181&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0005484181&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(91)90011-P

DO - 10.1016/0012-365X(91)90011-P

M3 - Article

AN - SCOPUS:0005484181

SN - 0012-365X

VL - 88

SP - 231

EP - 237

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2-3

ER -

A polynomial time approximation algorithm for dynamic storage allocation

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this