Single and multiple device DSA problems, complexities and online algorithms

DOI10.1016/J.TCS.2011.11.005zbMath1234.68144OpenAlexW2003665042MaRDI QIDQ764370

Minming Li, Jason Chun Xue, Wanyong Tian, Weiwei Wu, Enhong Chen

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.005

zbMATH Keywords

online algorithmsNP-completenessdynamic storage allocationmultiple device

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Cites Work

• A polynomial time approximation algorithm for dynamic storage allocation
• OPT versus LOAD in dynamic storage allocation
• The Linearity of First-Fit Coloring of Interval Graphs
• Approximation algorithms for dynamic storage allocation
• Computing and Combinatorics
• Computing and Combinatorics
• Dynamic storage allocation with known durations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Single and multiple device DSA problems, complexities and online algorithms