{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T13:10:04Z","timestamp":1739797804263,"version":"3.37.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10878-010-9292-z","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T17:04:16Z","timestamp":1265303056000},"page":"359-377","source":"Crossref","is-referenced-by-count":1,"title":["Online tree node assignment with resource augmentation"],"prefix":"10.1007","volume":"22","author":[{"given":"Joseph Wun-Tat","family":"Chan","sequence":"first","affiliation":[]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"issue":"4\u20135","key":"9292_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s00236-004-0159-6","volume":"41","author":"GS Brodal","year":"2005","unstructured":"Brodal GS, Demaine ED, Munro JI (2005) Fast allocation and deallocation with an improved buddy system. Acta Inform 41(4\u20135):273\u2013291","journal-title":"Acta Inform"},{"key":"9292_CR2","doi-asserted-by":"crossref","unstructured":"Chin FYL, Ting H-F, Zhang Y (2007) A constant-competitive algorithm for online ovsf code assignment. In: Proceedings of the 18th international symposium on algorithms and computation (ISAAC), pp\u00a0452\u2013463. (The paper is to appear in Algorithmica)","DOI":"10.1007\/978-3-540-77120-3_40"},{"key":"9292_CR3","unstructured":"Chin FYL, Ting H-F, Zhang Y (2008) Constant-competitive tree node assignment. Manuscript"},{"key":"9292_CR4","doi-asserted-by":"crossref","unstructured":"Chin FYL, Zhang Y, Zhu H (2007) Online OVSF code assignment with resource augmentation. In: Proceedings of the third international conference on algorithmic aspects in information and management (AAIM), pp 191\u2013200","DOI":"10.1007\/978-3-540-72870-2_18"},{"key":"9292_CR5","doi-asserted-by":"crossref","unstructured":"Defoe DC, Cholleti SR, Cytron R (2005) Upper bound for defragmenting buddy heaps. In: Proceedings of the 2005. ACM SIGPLAN\/SIGBED conference on languages, compilers, and tools for embedded systems, pp 222\u2013229","DOI":"10.1145\/1065910.1065942"},{"issue":"3","key":"9292_CR6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/12.76413","volume":"40","author":"S Dutt","year":"1991","unstructured":"Dutt S, Hayes JP (1991) Subcube allocation in hypercube computers. IEEE Trans Comput 40(3):341\u2013352","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"9292_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00453-006-0188-3","volume":"47","author":"T Erlebach","year":"2007","unstructured":"Erlebach T, Jacob R, Mihal\u00e1k M, Nunkesser M, Szab\u00f3 G, Widmayer P (2007) An algorithmic view on OVSF code assignment. Algorithmica 47(3):269\u2013298","journal-title":"Algorithmica"},{"key":"9292_CR8","doi-asserted-by":"crossref","unstructured":"Erlebach T, Jacob R, Tomamichel M (2005) Algorithmische Aspekte von OVSF Code Assignment mit Schwerpunkt auf Offline Code Assignment. Student thesis at ETH Z\u00fcrich","DOI":"10.1007\/978-3-540-24749-4_24"},{"key":"9292_CR9","doi-asserted-by":"crossref","unstructured":"Forisek M, Katreniak B, Katreniakov\u00e1 J, Kralovic R, Kr\u00e1lovic R, Koutn\u00fd V, Pardubsk\u00e1 D, Plachetka T, Rovan B (2007) Online bandwidth allocation. In: Proceedings of the 15th annual European symposium on algorithms (ESA), pp 546\u2013557","DOI":"10.1007\/978-3-540-75520-3_49"},{"issue":"4","key":"9292_CR10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram B, Pruhs K (2000) Speed is as powerful as clairvoyance. J ACM 47(4):617\u2013643","journal-title":"J ACM"},{"issue":"10","key":"9292_CR11","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/365628.365655","volume":"8","author":"KC Knowlton","year":"1965","unstructured":"Knowlton KC (1965) A fast storage allocator. Commun ACM 8(10):623\u2013624","journal-title":"Commun ACM"},{"key":"9292_CR12","volume-title":"The art of computer programming, volume 1: fundamental algorithms","author":"DE Knuth","year":"1975","unstructured":"Knuth DE (1975) The art of computer programming, volume 1: fundamental algorithms. Addison-Wesley, Reading"},{"key":"9292_CR13","unstructured":"Li X-Y, Wan P-J (2005) Theoretically good distributed CDMA\/OVSF code assignment for wireless ad hoc networks. In: Proceedings of the 11th annual international conference of computing and combinatorics (COCOON), pp 126\u2013135"},{"issue":"8","key":"9292_CR14","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1109\/49.864008","volume":"18","author":"T Minn","year":"2000","unstructured":"Minn T, Siu K-Y (2000) Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA. IEEE J Sel Areas Commun 18(8):1429\u20131440","journal-title":"IEEE J Sel Areas Commun"},{"key":"9292_CR15","doi-asserted-by":"crossref","unstructured":"Miyazaki S, Okamoto K (2008) Improving the competitive ratio of the online OVSF code assignment problem. In: Proceedings of the 19th international symposium on algorithms and computation (ISAAC), pp 64\u201376","DOI":"10.1007\/978-3-540-92182-0_9"},{"key":"9292_CR16","doi-asserted-by":"crossref","unstructured":"Rouskas AN, Skoutas DN (2002) OVSF codes assignment and reassignment at the forward link of W-CDMA 3G systems In: Proceedings of the 13th IEEE international symposium on personal, indoor and mobile radio communications, vol 5, pp 2404\u20132408","DOI":"10.1109\/PIMRC.2002.1046575"},{"issue":"4","key":"9292_CR17","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/s00453-007-9094-6","volume":"49","author":"P-J Wan","year":"2007","unstructured":"Wan P-J, Li X-Y, Frieder O (2007) OVSF-CDMA code assignment in wireless ad hoc networks. Algorithmica 49(4):264\u2013285","journal-title":"Algorithmica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9292-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9292-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9292-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T12:46:35Z","timestamp":1739796395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9292-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9292"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9292-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}