{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:14Z","timestamp":1725603674873},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_22","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"251-262","source":"Crossref","is-referenced-by-count":0,"title":["Better Bounds for Incremental Frequency Allocation in Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[]},{"given":"\u0141ukasz","family":"Je\u017c","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","first-page":"261","volume":"1","author":"K. Aardal","year":"2003","unstructured":"Aardal, K., van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies\u00a01, 261\u2013317 (2003)","journal-title":"4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y.: Online frequency allocation in cellular networks. In: SPAA 2007, pp. 241\u2013249 (2007)","DOI":"10.1145\/1248377.1248418"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y.: Absolute and asymptotic bounds for online frequency allocation in cellular networks. Algorithmica\u00a058, 498\u2013515 (2010)","DOI":"10.1007\/s00453-009-9279-2"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11940128_8","volume-title":"Algorithms and Computation","author":"J.W.-T. Chan","year":"2006","unstructured":"Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Frequency allocation problems for linear cellular networks. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 61\u201370. Springer, Heidelberg (2006)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-540-73545-8_51","volume-title":"Computing and Combinatorics","author":"F.Y.L. Chin","year":"2007","unstructured":"Chin, F.Y.L., Zhang, Y., Zhu, H.: A 1-Local 13\/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 526\u2013536. Springer, Heidelberg (2007)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Sgall, J.: Three results on frequency assignment in linear cellular networks. Theoretical Computer Science\u00a0411, 131\u2013137 (2010)","DOI":"10.1016\/j.tcs.2009.09.019"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"McDiarmid, C., Reed, B.: Channel assignment and weighted colouring. Networks\u00a036, 114\u2013117 (2000)","DOI":"10.1002\/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Murphey, R.A., Pardalos, P.M., Resende, M.G.C.: Frequency assignment problems. In: Handbook of Combinatorial Optimization, pp. 295\u2013377. Kluwer Academic Publishers, Dordrecht (1999)","DOI":"10.1007\/978-1-4757-3023-4_6"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Narayanan, L., Shende, S.M.: Static frequency assignment in cellular networks. Algorithmica\u00a029, 396\u2013409 (2001)","DOI":"10.1007\/s004530010067"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:41Z","timestamp":1560514121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}