A polynomial time approximation algorithm for dynamic storage allocation

Research output: Contribution to journalArticle

56 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)231-237
Number of pages7
JournalDiscrete Mathematics
Volume88
Issue number2-3
DOIs
StatePublished - Apr 19 1991
Externally publishedYes

Fingerprint

Approximation algorithms
Polynomial-time Algorithm
Approximation Algorithms
Polynomials
Interval Graphs
Coloring
Colouring
Upper bound

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

A polynomial time approximation algorithm for dynamic storage allocation. / Kierstead, Henry.

In: Discrete Mathematics, Vol. 88, No. 2-3, 19.04.1991, p. 231-237.

Research output: Contribution to journalArticle

@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 = "Henry Kierstead",
year = "1991",
month = "4",
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, Henry

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

VL - 88

SP - 231

EP - 237

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2-3

ER -