{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:25:37Z","timestamp":1725535537334},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030727"},{"type":"electronic","value":"9783642030734"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03073-4_9","type":"book-chapter","created":{"date-parts":[[2009,7,14]],"date-time":"2009-07-14T04:06:17Z","timestamp":1247544377000},"page":"79-88","source":"Crossref","is-referenced-by-count":2,"title":["Minimum Entropy Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Belongie, S.: On the non-optimality of four color coding of image partitions. In: ICIP 2002: Proceedings of the IEEE International Conference on Image Processing (2002)","DOI":"10.1109\/ICIP.2002.1040041"},{"issue":"5","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1109\/18.532875","volume":"42","author":"N. Alon","year":"1996","unstructured":"Alon, N., Orlitsky, A.: Source coding and graph entropies. IEEE Trans. Inform. Theory\u00a042(5), 1329\u20131339 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1504\/IJBRA.2005.008448","volume":"1","author":"P. Bonizzoni","year":"2005","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R., Mariani, L.: Experimental analysis of a new algorithm for partial haplotype completion. Int. J. Bioinformatics Res. Appl.\u00a01(4), 461\u2013473 (2005)","journal-title":"Int. J. Bioinformatics Res. Appl."},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10878-008-9152-2","volume":"16","author":"J. Cardinal","year":"2008","unstructured":"Cardinal, J., Fiorini, S., Joret, G.: Minimum entropy coloring. J. Comb. Opt.\u00a016(4), 361\u2013377 (2008)","journal-title":"J. Comb. Opt."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.orl.2008.06.010","volume":"36","author":"J. Cardinal","year":"2008","unstructured":"Cardinal, J., Fiorini, S., Joret, G.: Minimum entropy orientations. Op. Res. Lett.\u00a036, 680\u2013683 (2008)","journal-title":"Op. Res. Lett."},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-007-9076-8","volume":"51","author":"J. Cardinal","year":"2008","unstructured":"Cardinal, J., Fiorini, S., Joret, G.: Tight results on minimum entropy set cover. Algorithmica\u00a051(1), 49\u201360 (2008)","journal-title":"Algorithmica"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Fiorini, S., Joret, G., Jungers, R., Munro, J.I.: An efficient algorithm for partial order production. In: STOC 2009: 41st ACM Symposium on Theory of Computing (2009) (to appear)","DOI":"10.1145\/1536414.1536430"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF02122693","volume":"10","author":"I. Csisz\u00e1r","year":"1990","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J., Lov\u00e1sz, L., Marton, K., Simonyi, G.: Entropy splitting for antiblocking corners and perfect graphs. Combinatorica\u00a010(1), 27\u201340 (1990)","journal-title":"Combinatorica"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Doshi, V., Shah, D., M\u00e9dard, M.: Source coding with distortion through graph coloring. In: ISIT 2007: Proceedings of the IEEE International Symposium on Information Theory, pp. 1501\u20131505 (2007)","DOI":"10.1109\/ISIT.2007.4557136"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Doshi, V., Shah, D., M\u00e9dard, M., Jaggi, S.: Graph coloring and conditional graph entropy. In: ACSSC 2006: Proceedings of the Fortieth Asilomar Conference on Signals, Systems and Computers, pp. 2137\u20132141 (2006)","DOI":"10.1109\/ACSSC.2006.355146"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Doshi, V., Shah, D., M\u00e9dard, M., Jaggi, S.: Distributed functional compression through graph coloring. In: DCC 2007: Proceedings of the IEEE Data Compression Conference, pp. 93\u2013102 (2007)","DOI":"10.1109\/DCC.2007.34"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U. Feige","year":"2004","unstructured":"Feige, U., Lov\u00e1sz, L., Tetali, P.: Approximating min sum set cover. Algorithmica\u00a040(4), 219\u2013234 (2004)","journal-title":"Algorithmica"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-77050-3_7","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"T. Fukunaga","year":"2007","unstructured":"Fukunaga, T., Halld\u00f3rsson, M.M., Nagamochi, H.: Rent-or-buy scheduling and cost coloring problems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 84\u201395. Springer, Heidelberg (2007)"},{"key":"9_CR15","unstructured":"Fukunaga, T., Halld\u00f3rsson, M.M., Nagamochi, H.: Robust cost colorings. In: SODA 2008: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1204\u20131212 (2008)"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1051\/ro:2007024","volume":"41","author":"D. Gijswijt","year":"2007","unstructured":"Gijswijt, D., Jost, V., Queyranne, M.: Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO \u2013 Operations Research\u00a041(3), 275\u2013287 (2007)","journal-title":"RAIRO \u2013 Operations Research"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1109\/TCBB.2007.70223","volume":"5","author":"A. Gusev","year":"2008","unstructured":"Gusev, A., M\u0103ndoiu, I.I., Pa\u015faniuc, B.: Highly scalable genotype phasing by entropy minimization. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a05(2), 252\u2013261 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. In: STOC 1994: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pp. 439\u2013448 (1994)","DOI":"10.1145\/195058.195221"},{"issue":"2-3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.tcs.2005.09.015","volume":"348","author":"E. Halperin","year":"2005","unstructured":"Halperin, E., Karp, R.M.: The minimum-entropy set cover problem. Theoret. Comput. Sci.\u00a0348(2-3), 240\u2013250 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"9_CR21","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.A.: An extremal problem in recursive combinatorics. Congr. Numer.\u00a033, 143\u2013153 (1981)","journal-title":"Congr. Numer."},{"key":"9_CR22","first-page":"411","volume-title":"Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes (Tech. Univ., Prague, 1971; dedicated to the memory of Anton\u00edn \u0160pa\u010dek)","author":"J. K\u00f6rner","year":"1973","unstructured":"K\u00f6rner, J.: Coding of an information source having ambiguous alphabet and the entropy of graphs. In: Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes (Tech. Univ., Prague, 1971; dedicated to the memory of Anton\u00edn \u0160pa\u010dek), pp. 411\u2013425. Academia, Prague (1973)"},{"issue":"6","key":"9_CR23","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1109\/18.720537","volume":"44","author":"J. K\u00f6rner","year":"1998","unstructured":"K\u00f6rner, J., Orlitsky, A.: Zero-error information theory. IEEE Trans. Inform. Theory\u00a044(6), 2207\u20132229 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TIT.2002.806154","volume":"49","author":"P. Koulgi","year":"2003","unstructured":"Koulgi, P., Tuncel, E., Regunathan, S., Rose, K.: On zero-error source coding with decoder side information. IEEE Trans. Inform. Theory\u00a049(1), 99\u2013111 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput.\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR26","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/PL00009252","volume":"23","author":"S. Nicoloso","year":"1999","unstructured":"Nicoloso, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica\u00a023(2), 109\u2013126 (1999)","journal-title":"Algorithmica"},{"issue":"1-3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.tcs.2007.04.040","volume":"381","author":"M. Parnas","year":"2007","unstructured":"Parnas, M., Ron, D.: Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theoret. Comput. Sci.\u00a0381(1-3), 183\u2013196 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR28","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.: Buffer minimization using max-coloring. In: SODA 2004: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 562\u2013571 (2004)"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell. System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell. System Technical Journal"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Simonyi, G.: Graph entropy: a survey. In: Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a020, pp. 399\u2013441 (1995)","DOI":"10.1090\/dimacs\/020\/08"},{"issue":"2","key":"9_CR31","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","volume":"24","author":"M. Yannakakis","year":"1987","unstructured":"Yannakakis, M., Gavril, F.: The maximum k-colorable subgraph problem for chordal graphs. Inf. Process. Lett.\u00a024(2), 133\u2013137 (1987)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Theory and Computational Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03073-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T08:33:44Z","timestamp":1558427624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03073-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030727","9783642030734"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03073-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}