{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:08:50Z","timestamp":1765368530459},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387976280"},{"type":"electronic","value":"9780387348155"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0038467","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:59:13Z","timestamp":1153994353000},"page":"15-21","source":"Crossref","is-referenced-by-count":5,"title":["Approximation algorithms for the chromatic sum"],"prefix":"10.1007","author":[{"given":"Ewa","family":"Kubicka","sequence":"first","affiliation":[]},{"given":"Grzegorz","family":"Kubicki","sequence":"additional","affiliation":[]},{"given":"Dionisios","family":"Kountanis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"3_CR1","unstructured":"G. Chartrand and L. Lesniak, Graphs & Digraphs, 2nd Edition. Wadsworth and Brooks\/Cole (1986)."},{"key":"3_CR2","unstructured":"P. Erd\u00f6s, E. Kubicka and A. Schwenk, Graphs that require extra colors to attain the chromatic sum, submitted to Congr. Numerantium."},{"key":"3_CR3","unstructured":"M. R. Garey, D. S. Johnson, Computers and Intractability, W. H. Freeman (San Francisco) (1979)."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. S. Johnson","year":"1974","unstructured":"D. S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences 9 (1974) 256\u2013278.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR5","unstructured":"D. S. Johnson, Worst Case Behavior of Graph Coloring Algorithms, Proc. of 5th Southeastern Conference on Combinatorics, Graph Theory and Computing (1974) 513\u2013524."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"E. Kubicka and A. J. Schwenk, Introduction to Chromatic Sums, Proceedings of ACM 1989 Computer Science Conference (1989) 39\u201345.","DOI":"10.1145\/75427.75430"},{"key":"3_CR7","first-page":"489","volume":"84","author":"F. T. Leighton","year":"1979","unstructured":"F. T. Leighton, A Graph Coloring Algorithm for Large Scheduling Problems, Journal of Research on the NBS 84 (1979) 489\u2013506.","journal-title":"Journal of Research on the NBS"},{"key":"3_CR8","first-page":"159","volume":"13","author":"A. J. Mansfield","year":"1982","unstructured":"A. J. Mansfield and D. J. A. Welsh, Some colouring problems and their complexity, Annals of Discrete Mathematics 13 (1982) 159\u2013170.","journal-title":"Annals of Discrete Mathematics"},{"key":"3_CR9","first-page":"197","volume":"33","author":"B. Manvel","year":"1981","unstructured":"B. Manvel, Coloring Large Graphs, Congressus Numerantium 33 (1981) 197\u2013204.","journal-title":"Congressus Numerantium"},{"key":"3_CR10","volume-title":"Graph Theory and Computing","author":"D. W. Matula","year":"1972","unstructured":"D. W. Matula, G. Marble, and J. D. Isaacson, Graph coloring algorithms, in R. C. Read (ed), Graph Theory and Computing, Academic Press, New York (1972)."},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230020104","volume":"2","author":"D. W. Matula","year":"1972","unstructured":"D. W. Matula, Bounded color functions on graphs, Networks 2 (1972) 129\u201344.","journal-title":"Networks"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/jgt.3190130310","volume":"13","author":"C. Thomassen","year":"1989","unstructured":"C. Thomassen, P. Erd\u00f6s, Y. Alavi, P. J. Malde, and A. J. Schwenk, Tight Bounds on the Chromatic Sum of a Connected Graph, J. Graph Theory 13 (1989) 353\u2013357","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Computing in the 90's"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0038467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T11:03:38Z","timestamp":1549883018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0038467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9780387976280","9780387348155"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0038467","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}