{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:51Z","timestamp":1725862731351},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_27","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T11:49:58Z","timestamp":1470656998000},"page":"347-358","source":"Crossref","is-referenced-by-count":1,"title":["Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs"],"prefix":"10.1007","author":[{"given":"Robert","family":"Benkoczi","sequence":"first","affiliation":[]},{"given":"Ram","family":"Dahal","sequence":"additional","affiliation":[]},{"given":"Daya Ram","family":"Gaur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"crossref","first-page":"2029","DOI":"10.1137\/140954167","volume":"28","author":"J Araujo","year":"2014","unstructured":"Araujo, J., Nisse, N., P\u00e9rennes, S.: Weighted coloring in trees. SIAM J. Discrete Math. 28(4), 2029\u20132041 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"27_CR2","unstructured":"Benkoczi, R.R.: Cardinality constrained facility location problems in trees. Ph.D. Thesis, Simon Fraser University (2004)"},{"issue":"3","key":"27_CR3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ipl.2005.09.013","volume":"97","author":"B Escoffier","year":"2006","unstructured":"Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring: further complexity and approximability results. Inf. Process. Lett. 97(3), 98\u2013103 (2006)","journal-title":"Inf. Process. Lett."},{"key":"27_CR4","volume-title":"The Four-Color Theorem: History, Topological Foundations, and Idea of Proof","author":"R Fritsch","year":"2012","unstructured":"Fritsch, R., Peschke, J., Fritsch, G.: The Four-Color Theorem: History, Topological Foundations, and Idea of Proof. Springer, New York (2012)"},{"key":"27_CR5","volume-title":"Computers and Intractability A Guide to the Theory of np-Completeness","author":"MR Gary","year":"1979","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability A Guide to the Theory of np-Completeness. WH Freman and Co, New York (1979)"},{"issue":"2","key":"27_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0020-0190(97)00002-1","volume":"61","author":"DJ Guan","year":"1997","unstructured":"Guan, D.J., Xuding, Z.: A coloring problem for weighted graphs. Inf. Process. Lett. 61(2), 77\u201381 (1997)","journal-title":"Inf. Process. Lett."},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-540-69903-3_19","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"MM Halld\u00f3rsson","year":"2008","unstructured":"Halld\u00f3rsson, M.M., Shachnai, H.: Batch coloring flat graphs and thin. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 198\u2013209. Springer, Heidelberg (2008)"},{"issue":"1","key":"27_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-010-9290-1","volume":"24","author":"T Kavitha","year":"2012","unstructured":"Kavitha, T., Mestre, J.: Max-coloring paths: tight bounds and extensions. J. Comb. Optim. 24(1), 1\u201314 (2012)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"27_CR9","first-page":"407","volume":"11","author":"N Khan","year":"2009","unstructured":"Khan, N., Pal, A., Pal, M.: Edge colouring of cactus graphs. Adv. Model. Optim 11(4), 407\u2013421 (2009)","journal-title":"Adv. Model. Optim"},{"issue":"3","key":"27_CR10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0166-218X(94)90150-3","volume":"50","author":"J Kratochvil","year":"1994","unstructured":"Kratochvil, J., Tuza, Z.: Algorithmic complexity of list colorings. Discrete Appl. Math. 50(3), 297\u2013302 (1994)","journal-title":"Discrete Appl. Math."},{"key":"27_CR11","volume-title":"A Guide to Graph Colouring, Algorithms and Applications","author":"R Lewis","year":"2015","unstructured":"Lewis, R.: A Guide to Graph Colouring, Algorithms and Applications. Springer, Switzerland (2015)"},{"issue":"5","key":"27_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10732-008-9075-1","volume":"15","author":"E Malaguti","year":"2009","unstructured":"Malaguti, E., Monaci, M., Toth, P.: Models and heuristic algorithms for a weighted vertex coloring problem. J. Heuristics 15(5), 503\u2013526 (2009)","journal-title":"J. Heuristics"},{"issue":"2","key":"27_CR13","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.: Channel assignment and weighted coloring. Networks 36(2), 114\u2013117 (2000)","journal-title":"Networks"},{"issue":"3","key":"27_CR14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1094549.1094554","volume":"9","author":"A Mishra","year":"2005","unstructured":"Mishra, A., Banerjee, S., Arbaugh, W.: Weighted coloring based channel assignment for wlans. SIGMOBILE Mob. Comput. Commun. Rev. 9(3), 19\u201331 (2005)","journal-title":"SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1007\/11523468_86","volume-title":"Automata, Languages and Programming","author":"SV Pemmaraju","year":"2005","unstructured":"Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1064\u20131075. Springer, Heidelberg (2005)"},{"issue":"3","key":"27_CR16","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12(3), 164\u2013176 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"27_CR17","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","volume":"41","author":"CC Ribeiro","year":"1989","unstructured":"Ribeiro, C.C., Minoux, M., Penna, M.C.: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment. Eur. J. Oper. Res. 41(2), 232\u2013239 (1989)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:11:14Z","timestamp":1498335074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}