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

Yuichi Asahiro (), Kenta Kanmera () and Eiji Miyano ()
Additional contact information
Yuichi Asahiro: Kyushu Sangyo University
Kenta Kanmera: Kyushu Institute of Technology
Eiji Miyano: Kyushu Institute of Technology

Journal of Combinatorial Optimization, 2013, vol. 26, issue 4, No 5, 687-708

Abstract: Abstract This paper studies the online Orthogonal Variable Spreading Factor (OVSF) code assignment problem with resource augmentation introduced by Erlebach et al. (in STACS 2004. LNCS, vol. 2996, pp. 270–281, 2004). We propose a (1+1/α)-competitive algorithm with help of (1+⌈α⌉)lg∗ h trees for the height h of the OVSF code tree and any α≥1. In other words, it is a (1+ε)-competitive algorithm with help of (1+⌈1/ε⌉)lg∗ h trees for any constant 0

Keywords: Online OVSF code assignment problem; Resource augmentation; Competitive algorithm (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9454-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-012-9454-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9454-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().