{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T00:04:36Z","timestamp":1692230676480},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,1,28]],"date-time":"2009-01-28T00:00:00Z","timestamp":1233100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s00453-009-9279-2","type":"journal-article","created":{"date-parts":[[2009,1,27]],"date-time":"2009-01-27T22:48:44Z","timestamp":1233096524000},"page":"498-515","source":"Crossref","is-referenced-by-count":8,"title":["Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks"],"prefix":"10.1007","volume":"58","author":[{"given":"Joseph Wun-Tat","family":"Chan","sequence":"first","affiliation":[]},{"given":"Francis Y. L.","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,28]]},"reference":[{"issue":"1","key":"9279_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","volume":"153","author":"K.I. Aardal","year":"2007","unstructured":"Aardal, K.I., van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1), 79\u2013129 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9279_CR2","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"5","key":"9279_CR3","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00224-002-1003-4","volume":"35","author":"I. Caragiannis","year":"2002","unstructured":"Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Efficient on-line frequency allocation and call control in cellular networks. Theory Comput. Syst. 35(5), 521\u2013543 (2002)","journal-title":"Theory Comput. Syst."},{"key":"9279_CR4","doi-asserted-by":"crossref","unstructured":"Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Frequency allocation problems for linear cellular networks. In: Proceedings of the 17th Annual International Symposium on Algorithms and Computation (ISAAC), pp. 61\u201370 (2006)","DOI":"10.1007\/11940128_8"},{"key":"9279_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ipl.2006.11.015","volume":"102","author":"J.W.-T. Chan","year":"2007","unstructured":"Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Greedy online frequency allocation in cellular networks. Inf. Process. Lett. 102, 55\u201361 (2007)","journal-title":"Inf. Process. Lett."},{"key":"9279_CR6","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., Ting, H.F., Zhang, Y.: A constant-competitive algorithm for online OVSF code assignment. In: Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), pp. 452\u2013463 (2007)","DOI":"10.1007\/978-3-540-77120-3_40"},{"key":"9279_CR7","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., Zhang, Y., Zhu, H.: A 1-local 13\/9-competitive algorithm for multicoloring hexagonal graphs. In: Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON), pp. 526\u2013536 (2007)","DOI":"10.1007\/978-3-540-73545-8_51"},{"key":"9279_CR8","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., Zhang, Y., Zhu, H.: Online OVSF code assignment with resource augmentation. In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), pp. 191\u2013200 (2007)","DOI":"10.1007\/978-3-540-72870-2_18"},{"issue":"3","key":"9279_CR9","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.: An algorithmic view on OVSF code assignment. Algorithmica 47(3), 269\u2013298 (2007)","journal-title":"Algorithmica"},{"issue":"6","key":"9279_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0020-0190(98)00126-4","volume":"67","author":"T. Feder","year":"1998","unstructured":"Feder, T., Shende, S.M.: Online channel allocation in FDMA networks with reuse constraints. Inf. Process. Lett. 67(6), 295\u2013302 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"9279_CR11","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.dam.2003.06.005","volume":"143","author":"S.L. Fitzpatrick","year":"2004","unstructured":"Fitzpatrick, S.L., Janssen, J., Nowakowski, R.J.: Distributive online channel assignment for hexagonal cellular networks with constraints. Discrete Appl. Math. 143(1\u20133), 84\u201391 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"9279_CR12","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W. Hale","year":"1980","unstructured":"Hale, W.: Frequency assignment: Theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"issue":"2","key":"9279_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jagm.1999.1068","volume":"36","author":"J. Janssen","year":"2000","unstructured":"Janssen, J., Krizanc, D., Narayanan, L., Shende, S.M.: Distributed online frequency assignment in cellular networks. J. Algorithms 36(2), 119\u2013151 (2000)","journal-title":"J. Algorithms"},{"issue":"3","key":"9279_CR14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/98.511762","volume":"3","author":"I. Katzela","year":"1996","unstructured":"Katzela, I., Naghshineh, M.: Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey. IEEE Pers. Commun. 3(3), 10\u201331 (1996)","journal-title":"IEEE Pers. Commun."},{"key":"9279_CR15","doi-asserted-by":"crossref","unstructured":"MacDonald, V.: Advanced mobile phone service: The cellular concept. Bell Syst. Tech. J. 58(1) (1979)","DOI":"10.1002\/j.1538-7305.1979.tb02209.x"},{"issue":"2","key":"9279_CR16","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1002\/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G","volume":"36","author":"C. McDiarmid","year":"2000","unstructured":"McDiarmid, C., Reed, B.A.: Channel assignment and weighted coloring. Networks 36(2), 114\u2013117 (2000)","journal-title":"Networks"},{"key":"9279_CR17","first-page":"331","volume-title":"Handbook of Combinatorial Optimization","author":"R.A. Murphey","year":"1999","unstructured":"Murphey, R.A., Pardalos, P.M., Resende, M.G.C.: Frequency assignment problems. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, vol. 4, pp. 331\u2013395. Kluwer Academic, Dordrecht (1999)"},{"key":"9279_CR18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/0471224561.ch4","volume-title":"Handbook of Wireless Networks and Mobile Computing","author":"L. Narayanan","year":"2002","unstructured":"Narayanan, L.: Channel assignment and graph multicoloring. In: Stojmenovi\u0107, I. (ed.) Handbook of Wireless Networks and Mobile Computing, pp. 71\u201394. Wiley, New York (2002)"},{"issue":"3","key":"9279_CR19","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s004530010067","volume":"29","author":"L. Narayanan","year":"2001","unstructured":"Narayanan, L., Shende, S.M.: Static frequency assignment in cellular networks. Algorithmica 29(3), 396\u2013409 (2001)","journal-title":"Algorithmica"},{"issue":"6","key":"9279_CR20","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/s00224-002-1032-z","volume":"35","author":"G.E. Pantziou","year":"2002","unstructured":"Pantziou, G.E., Pentaris, G.P., Spirakis, P.G.: Competitive call control in mobile networks. Theory Comput. Syst. 35(6), 625\u2013639 (2002)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"9279_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jalgor.2004.09.001","volume":"55","author":"P. Sparl","year":"2005","unstructured":"Sparl, P., Zerovnik, J.: 2-local 4\/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55(1), 29\u201341 (2005)","journal-title":"J. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9279-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9279-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9279-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:03Z","timestamp":1559137503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9279-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,28]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9279"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9279-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,28]]}}}