Generalized dynamic storage allocation

Henry Kierstead, Karin R. Saoub

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time restrictions. Approximate algorithms have been constructed through online coloring of interval graphs. We present a generalization that uses online coloring of tolerance graphs. We utilize online-with-representation algorithms on tolerance graphs, which are online algorithms in which the corresponding tolerance representation of a vertex is also presented. We find linear bounds for the online-with-representation chromatic number of various classes of tolerance graphs and apply these results to a generalization of Dynamic Storage Allocation, giving us a polynomial time approximation algorithm with linear performance ratio.

Original languageEnglish (US)
Pages (from-to)253-262
Number of pages10
JournalDiscrete Mathematics and Theoretical Computer Science
Volume16
Issue number3
StatePublished - 2014

Keywords

  • Dynamic storage allocation
  • Online coloring
  • Tolerance graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Generalized dynamic storage allocation'. Together they form a unique fingerprint.

Cite this