{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:15Z","timestamp":1725559455044},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_53","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"602-605","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kochol","sequence":"first","affiliation":[]},{"given":"Nad\u2019a","family":"Krivo\u0148\u00e1kov\u00e1","sequence":"additional","affiliation":[]},{"given":"Silvia","family":"Smejov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput.\u00a010, 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"53_CR2","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. Phys.\u00a028, 148\u2013151 (1949)","journal-title":"J. Math. Phys."},{"key":"53_CR3","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz\u00a03, 25\u201330 (1964) (in Russian)","journal-title":"Diskret. Analiz"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:01:28Z","timestamp":1558296088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/11427186_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}