STACS 2004

DOI10.1007/B96012MaRDI QIDQ5309706zbMATH OpenOpenAlexFDO

Authors Thomas Erlebach, Riko Jacob, Matúš Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer

Publication date 1 October 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b96012

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Communication theory (94A05)

Recommendations

• An algorithmic view on OVSF code assignment
• A constant-competitive algorithm for online OVSF code assignment
• Online OVSF Code Assignment with Resource Augmentation
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• (1 + )-competitive algorithm for online OVSF code assignment with resource augmentation

Cited in

(6)

• On Walsh code assignment
• (1+ )-competitive algorithm for online OVSF code assignment with resource augmentation
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• Online OVSF Code Assignment with Resource Augmentation
• Computing and Combinatorics
• An algorithmic view on OVSF code assignment

This page was built for publication: STACS 2004

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