Single and multiple device DSA problems, complexities and online algorithms

DOI10.1016/J.TCS.2011.11.005zbMATH Open1234.68144OpenAlexW2003665042MaRDI QIDQ764370FDOQ764370

Authors: Weiwei Wu, Minming Li, Wanyong Tian, Jason Chun Xue, 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

Recommendations

• Single and multiple device DSA problem, complexities and online algorithms
• Approximation algorithms for dynamic storage allocation
• Computing and Combinatorics
• scientific article; zbMATH DE number 4043214
• scientific article; zbMATH DE number 1003306

zbMATH Keywords

online algorithmsNP-completenessdynamic storage allocationmultiple device

Mathematics Subject Classification ID

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

Cites Work

• The Linearity of First-Fit Coloring of Interval Graphs
• Approximation algorithms for dynamic storage allocation
• Title not available (Why is that?)
• Computing and Combinatorics
• Title not available (Why is that?)
• A polynomial time approximation algorithm for dynamic storage allocation
• Title not available (Why is that?)
• OPT versus LOAD in dynamic storage allocation
• Title not available (Why is that?)
• Computing and Combinatorics
• Dynamic storage allocation with known durations

Cited In (2)

• Computing and Combinatorics
• Single and multiple device DSA problem, complexities and online algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764370)