(1+ )-competitive algorithm for online OVSF code assignment with resource augmentation

From MaRDI portal
(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation

DOI10.1007/S10878-012-9454-2MaRDI QIDQ386436zbMATH OpenOpenAlexFDO

Authors Yuichi Asahiro, Kenta Kanmera, Eiji Miyano

Publication date 9 December 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9454-2


zbMATH Keywords

competitive algorithmonline OVSF code assignment problemresource augmentation

Mathematics Subject Classification ID

Discrete location and assignment (90B80)





Recommendations


Cites work


Cited in
(7)








This page was built for publication: (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=(%5C(1%2B%5Cvarepsilon_%5C))-competitive_algorithm_for_online_OVSF_code_assignment_with_resource_augmentation&oldid=61531974"
Powered by MediaWiki