{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:42Z","timestamp":1725558942968},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245742"},{"type":"electronic","value":"9783540318330"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31833-0_3","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:11:05Z","timestamp":1278094265000},"page":"9-22","source":"Crossref","is-referenced-by-count":4,"title":["Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach.\u00a041(1), 153\u2013180 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1006\/jagm.2000.1106","volume":"37","author":"A. Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Halld\u00f3rsson, M.M., Kortsarz, G., Salman, R., Shachnai, H.: Sum multicoloring of graphs. J. Algorithms\u00a037(2), 422\u2013450 (2000)","journal-title":"J. Algorithms"},{"issue":"1-2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E.G. Coffman Jr.","year":"1985","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput.\u00a014(3), 744\u2013780 (1985)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1006\/jagm.2001.1210","volume":"42","author":"M.M. Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. J. Algorithms\u00a042(2), 334\u2013366 (2002)","journal-title":"J. Algorithms"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0890-5401(02)00032-9","volume":"180","author":"M.M. Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A.: Multicoloring trees. Inform. and Comput.\u00a0180(2), 113\u2013129 (2003)","journal-title":"Inform. and Comput."},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J.A. Hoogeveen","year":"1994","unstructured":"Hoogeveen, J.A., van de Velde, S.L., Veltman, B.: Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl. Math.\u00a055(3), 259\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1006\/jctb.1996.0067","volume":"68","author":"J. Kahn","year":"1996","unstructured":"Kahn, J.: Asymptotics of the chromatic index for multigraphs. J. Combin. Theory Ser. B\u00a068(2), 233\u2013254 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR9","unstructured":"Marx, D.: Complexity results for minimum sum edge multicoloring. (Manuscript)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/3-540-45687-2_44","volume-title":"Mathematical Foundations of Computer Science 2002 (Warsaw-Otwock)","author":"D. Marx","year":"2002","unstructured":"Marx, D.: The complexity of tree multicolorings. In: Mathematical Foundations of Computer Science 2002 (Warsaw-Otwock), pp. 532\u2013542. Springer, Berlin (2002)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-24592-6_17","volume-title":"Approximation and Online Algorithms","author":"D. Marx","year":"2004","unstructured":"Marx, D.: Minimum sum multicoloring on the edges of trees. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol.\u00a02909, pp. 214\u2013226. Springer, Heidelberg (2004)"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: A theorem on coloring the lines of a network. J. Math. Physics\u00a028, 148\u2013151 (1949)","journal-title":"J. Math. Physics"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31833-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:41:25Z","timestamp":1620013285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31833-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245742","9783540318330"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31833-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}