{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:15Z","timestamp":1725795135997},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_18","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:18:07Z","timestamp":1401409087000},"page":"194-204","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Bandwidth Consecutive Multicolorings"],"prefix":"10.1007","author":[{"given":"Yuji","family":"Obata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Corman","year":"2001","unstructured":"Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press and McGraw Hill, Cambridge, MA (2001)"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2298\/YJOR100927020F","volume":"22","author":"J. Fijuljamin","year":"2012","unstructured":"Fijuljamin, J.: Two genetic algorithms for the bandwidth multicoloring problem. Yugoslav Journal of Operation Research\u00a022(2), 225\u2013246 (2012)","journal-title":"Yugoslav Journal of Operation Research"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization. J. Assoc. Comput. Mach.\u00a034, 596\u2013615 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR4","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. John Wiley & Sons, New York (1995)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0095-8956(75)90089-1","volume":"19","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: Three short proofs in graph theory. J. Combinatorial Theory (B)\u00a019, 269\u2013271 (1975)","journal-title":"J. Combinatorial Theory (B)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/j.ejor.2006.09.095","volume":"189","author":"E. Malaguti","year":"2008","unstructured":"Malaguti, E., Toth, P.: An evolutionary approach for bandwidth multicoloring problems. European Journal of Operation Research\u00a0189, 638\u2013651 (2008)","journal-title":"European Journal of Operation Research"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1504\/IJMHEUR.2010.033121","volume":"1","author":"R. Marti","year":"2010","unstructured":"Marti, R., Gortazar, F., Duarte, A.: Heuristics for the bandwidth colouring problem. Int. J. of Metaheuristics\u00a01(1), 11\u201329 (2010)","journal-title":"Int. J. of Metaheuristics"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0012-365X(02)00821-X","volume":"266","author":"C. McDiamid","year":"2003","unstructured":"McDiamid, C.: On the span in channel assignment problems: bounds, computing and counting. Discrete Math.\u00a0266, 387\u2013397 (2003)","journal-title":"Discrete Math."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0012-365X(03)00236-X","volume":"273","author":"C. McDiamid","year":"2003","unstructured":"McDiamid, C., Reed, B.: Channel assignment on graphs of bounded treewidth. Discrete Math.\u00a0273, 183\u2013192 (2003)","journal-title":"Discrete Math."},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-29700-7_11","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"K. Nishikawa","year":"2012","unstructured":"Nishikawa, K., Nishizeki, T., Zhou, X.: Algorithms for bandwidth consecutive multicolorings of graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol.\u00a07285, pp. 117\u2013128. Springer, Heidelberg (2012); also Theoretical Computer Science (to appear)"},{"key":"18_CR11","volume-title":"Scheduling: Theory, Algorithms and Systems","author":"M.L. Pinedo","year":"2008","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms and Systems. Springer Science, New York (2008)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach.\u00a029, 623\u2013641 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR13","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theoretical Computer Science\u00a03, 103\u2013128 (2007)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:08:31Z","timestamp":1558897711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}