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
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (27)
A subexponential upper bound for the on-line chain partitioning problem ⋮ On the performance guarantee of first fit for sum coloring ⋮ Coloring interval graphs with First-Fit ⋮ An off-line storage allocation algorithm ⋮ Online promise problems with online width metrics ⋮ An improved algorithm for online coloring of intervals with bandwidth ⋮ Improved lower bound on the on-line chain partitioning of semi-orders with representation ⋮ On-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratio ⋮ Optimal on-line coloring of circular arc graphs ⋮ On-line dimension for posets excluding two long incomparable chains ⋮ Online coloring of short intervals ⋮ Unnamed Item ⋮ First-Fit is linear on posets excluding two long incomparable chains ⋮ A note on first-fit coloring of interval graphs ⋮ On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains ⋮ A polynomial time approximation algorithm for dynamic storage allocation ⋮ On spectrum assignment in elastic optical tree-networks ⋮ First-fit coloring on interval graphs has performance ratio at least 5 ⋮ Online interval coloring with packing constraints ⋮ On the max coloring problem ⋮ First-fit coloring of bounded tolerance graphs ⋮ Unnamed Item ⋮ On the Max Coloring Problem ⋮ Complexity and online algorithms for minimum skyline coloring of intervals ⋮ Variable sized online interval coloring with bandwidth ⋮ On-line chain partitions of orders: a survey ⋮ On-line coloring and cliques covering for \(\mathbb K_{s,t}\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An off-line storage allocation algorithm
- Lower bounds for on-line two-dimensional packing algorithms
- Dynamic Bin Packing
- An Introduction to Combinatorial Models of Dynamic Storage Allocation
- Shelf Algorithms for Two-Dimensional Packing Problems
- A algorithm for two-dimensional packing
- A two-dimensional bin-packing model of preemptive, FIFO storage allocation
- Bounds for Some Functions Concerning Dynamic Storage Allocation
This page was built for publication: On some packing problem related to dynamic storage allocation
