On some packing problem related to dynamic storage allocation

From MaRDI portal
Publication:3830539

DOI10.1051/ita/1988220404871zbMath0675.68041OpenAlexW203573418MaRDI QIDQ3830539

Maciej Ślusarek, Marek Chrobak

Publication date: 1988

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92318




Related Items (27)

A subexponential upper bound for the on-line chain partitioning problemOn the performance guarantee of first fit for sum coloringColoring interval graphs with First-FitAn off-line storage allocation algorithmOnline promise problems with online width metricsAn improved algorithm for online coloring of intervals with bandwidthImproved lower bound on the on-line chain partitioning of semi-orders with representationOn-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratioOptimal on-line coloring of circular arc graphsOn-line dimension for posets excluding two long incomparable chainsOnline coloring of short intervalsUnnamed ItemFirst-Fit is linear on posets excluding two long incomparable chainsA note on first-fit coloring of interval graphsOn-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chainsA polynomial time approximation algorithm for dynamic storage allocationOn spectrum assignment in elastic optical tree-networksFirst-fit coloring on interval graphs has performance ratio at least 5Online interval coloring with packing constraintsOn the max coloring problemFirst-fit coloring of bounded tolerance graphsUnnamed ItemOn the Max Coloring ProblemComplexity and online algorithms for minimum skyline coloring of intervalsVariable sized online interval coloring with bandwidthOn-line chain partitions of orders: a surveyOn-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs



Cites Work


This page was built for publication: On some packing problem related to dynamic storage allocation