{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:03Z","timestamp":1725560763823},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145520"},{"type":"electronic","value":"9783642145537"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14553-7_26","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T07:59:21Z","timestamp":1280131161000},"page":"274-284","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Sakamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.endm.2008.01.008","volume":"30","author":"J. Cardinal","year":"2008","unstructured":"Cardinal, J., Ravelomanana, V., Valencia-Pabon, M.: Chromatic edge strength of some multigraphs. Electronic Notes in Discrete Mathematics\u00a030, 39\u201344 (2008)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E.G. Coffman","year":"1985","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Computing\u00a014, 744\u2013780 (1985)","journal-title":"SIAM J. Computing"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H.N. Gabow","year":"1989","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Computing\u00a018, 1013\u20131036 (1989)","journal-title":"SIAM J. Computing"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0020-0190(00)00072-7","volume":"75","author":"K. Giaro","year":"2000","unstructured":"Giaro, K., Kubale, M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Information Processing Letters\u00a075, 65\u201369 (2000)","journal-title":"Information Processing Letters"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0012-365X(99)00319-2","volume":"215","author":"H. Hajiabolhassan","year":"2000","unstructured":"Hajiabolhassan, H., Mehrabadi, M.L., Tusserkani, R.: Minimal coloring and strength of graphs. Discrete Mathematics\u00a0215, 265\u2013270 (2000)","journal-title":"Discrete Mathematics"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TC.1985.1676647","volume":"34","author":"H. Krawczyk","year":"1985","unstructured":"Krawczyk, H., Kubale, M.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Computers\u00a034, 869\u2013872 (1985)","journal-title":"IEEE Trans. Computers"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1016\/j.dam.2008.04.002","volume":"157","author":"D. Marx","year":"2009","unstructured":"Marx, D.: Complexity results for minimum sum edge coloring. Discrete Applied Mathematics\u00a0157, 1034\u20131045 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.7151\/dmgt.1050","volume":"17","author":"J. Mitchem","year":"1997","unstructured":"Mitchem, J., Morriss, P., Schmeichel, E.: On the cost chromatic number of outerplanar, planar, and line graphs. Discussiones Mathematicae Graph Theory\u00a017, 229\u2013241 (1997)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"26_CR9","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New Jersey (2000)","edition":"2"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/B:JOCO.0000021940.40066.0c","volume":"8","author":"X. Zhou","year":"2004","unstructured":"Zhou, X., Nishizeki, T.: Algorithm for the cost edge-coloring of trees. J. Combinatorial Optimization\u00a08, 97\u2013108 (2004)","journal-title":"J. Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14553-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:27:42Z","timestamp":1552822062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14553-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145520","9783642145537"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14553-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}