A polynomial time approximation algorithm for dynamic storage allocation

Research output: Contribution to journalArticlepeer-review

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'A polynomial time approximation algorithm for dynamic storage allocation'. Together they form a unique fingerprint.

Cite this