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.
https://hal.inria.fr/hal-01188897
Contributeur : Coordination Episciences Iam
<>
Soumis le : lundi 31 août 2015 - 17:02:56
Dernière modification le : jeudi 7 septembre 2017 - 01:03:42
Document(s) archivé(s) le : mardi 1 décembre 2015 - 10:40:58
H. A. Kierstead, Karin R. Saoub. Generalized dynamic storage allocation. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 3 (in progress) (3), pp.253--262. 〈hal-01188897〉
