{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:26Z","timestamp":1725551426616},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121388"},{"type":"electronic","value":"9783642121395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12139-5_6","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T14:46:40Z","timestamp":1270046800000},"page":"59-70","source":"Crossref","is-referenced-by-count":1,"title":["A Genetic Algorithm to Minimize Chromatic Entropy"],"prefix":"10.1007","author":[{"given":"Greg","family":"Durrett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muriel","family":"M\u00e9dard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Una-May","family":"O\u2019Reilly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Doshi, V., Shah, D., Medard, M., Jaggi, S.: Distributed functional compression through graph coloring. In: Data Compression Conference, DCC 2007, March 2007, pp. 93\u2013102 (2007)","DOI":"10.1109\/DCC.2007.34"},{"key":"6_CR2","unstructured":"Cardinal, J., Fiorini, S., Van Assche, G.: A graph coloring problem with applications to data compression (2004)"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"19","author":"D. Slepian","year":"1973","unstructured":"Slepian, D., Wolf, J.: Noiseless coding of correlated information sources. IEEE Transactions on Information Theory\u00a019(4), 471\u2013480 (1973)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR4","unstructured":"K\u00f6rner, J.: Coding of an information source having ambiguous alphabet and the entropy of graphs. In: 6th Prague Conference on Information Theory, pp. 411\u2013425 (1973)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1109\/18.532875","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Orlitsky, A.: Source coding and graph entropies. IEEE Trans. Inform. Theory\u00a042, 1329\u20131339 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/BFb0056916","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.K.: A new genetic local search algorithm for graph coloring. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 745\u2013754. Springer, Heidelberg (1998)"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"A.E. Eiben","year":"1998","unstructured":"Eiben, A.E., Van Der Hauw, J.K., Van Hemert, J.I.: Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics\u00a04(1), 25\u201346 (1998)","journal-title":"Journal of Heuristics"},{"issue":"3","key":"6_CR8","first-page":"249","volume":"9","author":"S.N. Sivanandam","year":"2005","unstructured":"Sivanandam, S.N., Sumathi, S., Hamsapriya, T.: A hybrid parallel genetic algorithm approach for graph coloring. Int. J. Know.-Based Intell. Eng. Syst.\u00a09(3), 249\u2013259 (2005)","journal-title":"Int. J. Know.-Based Intell. Eng. Syst."},{"key":"6_CR9","first-page":"245","volume-title":"Dimacs Series in Discrete Mathematics and Theoretical Computer Science","author":"J.C. Culberson","year":"1995","unstructured":"Culberson, J.C., Luo, F.: Exploring the k-colorable landscape with iterated greedy. In: Dimacs Series in Discrete Mathematics and Theoretical Computer Science, pp. 245\u2013284. American Mathematical Society, Providence (1995)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12139-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:03:36Z","timestamp":1619784216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12139-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121388","9783642121395"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12139-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}