Generalized dynamic storage allocation - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

Generalized dynamic storage allocation

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.
Fichier principal
Vignette du fichier
dmtcs-16-3-14.pdf (267.82 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01188897 , version 1 (31-08-2015)

Identifiers

Cite

H. A. Kierstead, Karin R. Saoub. Generalized dynamic storage allocation. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 3 (3), pp.253--262. ⟨10.46298/dmtcs.2083⟩. ⟨hal-01188897⟩

Collections

TDS-MACS
46 View
877 Download

Altmetric

Share

Gmail Facebook X LinkedIn More