{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:49:43Z","timestamp":1648532983962},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,23]],"date-time":"2011-11-23T00:00:00Z","timestamp":1322006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00224-011-9371-2","type":"journal-article","created":{"date-parts":[[2011,11,22]],"date-time":"2011-11-22T08:00:57Z","timestamp":1321948857000},"page":"4-21","source":"Crossref","is-referenced-by-count":5,"title":["Minimum Entropy Combinatorial Optimization Problems"],"prefix":"10.1007","volume":"51","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,23]]},"reference":[{"key":"9371_CR1","volume-title":"ICIP\u201902: Proceedings of the IEEE International Conference on Image Processing","author":"S. Agarwal","year":"2002","unstructured":"Agarwal, S., Belongie, S.: On the non-optimality of four color coding of image partitions. In: ICIP\u201902: Proceedings of the IEEE International Conference on Image Processing (2002)"},{"issue":"5","key":"9371_CR2","doi-asserted-by":"crossref","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. Inf. Theory 42(5), 1329\u20131339 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"9371_CR3","doi-asserted-by":"crossref","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. Bioinform. Res. Appl. 1(4), 461\u2013473 (2005)","journal-title":"Int. J. Bioinform. Res. Appl."},{"key":"9371_CR4","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1999)"},{"issue":"4","key":"9371_CR5","doi-asserted-by":"crossref","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. Optim. 16(4), 361\u2013377 (2008)","journal-title":"J. Comb. Optim."},{"key":"9371_CR6","doi-asserted-by":"crossref","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. Oper. Res. Lett. 36, 680\u2013683 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9371_CR7","doi-asserted-by":"crossref","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 51(1), 49\u201360 (2008)","journal-title":"Algorithmica"},{"key":"9371_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-642-03073-4_9","volume-title":"Proceedings of the 5th Conference on Computability in Europe","author":"J. Cardinal","year":"2009","unstructured":"Cardinal, J., Fiorini, S., Joret, G.: Minimum entropy combinatorial optimization problems. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) Proceedings of the 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, 19\u201324 July 2009. Lecture Notes in Computer Science, vol. 5635, pp. 79\u201388. Springer, Berlin (2009)"},{"issue":"7","key":"9371_CR9","doi-asserted-by":"crossref","first-page":"2927","DOI":"10.1137\/090759860","volume":"39","author":"J. Cardinal","year":"2010","unstructured":"Cardinal, J., Fiorini, S., Joret, G., Jungers, R.M., Munro, J.I.: An efficient algorithm for partial order production. SIAM J. Comput. 39(7), 2927\u20132940 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9371_CR10","doi-asserted-by":"crossref","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 10(1), 27\u201340 (1990)","journal-title":"Combinatorica"},{"key":"9371_CR11","doi-asserted-by":"crossref","first-page":"2137","DOI":"10.1109\/ACSSC.2006.355146","volume-title":"ACSSC \u201906: Proceedings of the Fortieth Asilomar Conference on Signals, Systems and Computers","author":"V. Doshi","year":"2006","unstructured":"Doshi, V., Shah, D., M\u00e9dard, M., Jaggi, S.: Graph coloring and conditional graph entropy. In: ACSSC \u201906: Proceedings of the Fortieth Asilomar Conference on Signals, Systems and Computers, pp. 2137\u20132141 (2006)"},{"key":"9371_CR12","first-page":"93","volume-title":"DCC \u201907: Proceedings of the IEEE Data Compression Conference","author":"V. Doshi","year":"2007","unstructured":"Doshi, V., Shah, D., M\u00e9dard, M., Jaggi, S.: Distributed functional compression through graph coloring. In: DCC \u201907: Proceedings of the IEEE Data Compression Conference, pp. 93\u2013102 (2007)"},{"key":"9371_CR13","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1109\/ISIT.2007.4557136","volume-title":"ISIT \u201907: Proceedings of the IEEE International Symposium on Information Theory","author":"V. Doshi","year":"2007","unstructured":"Doshi, V., Shah, D., M\u00e9dard, M.: Source coding with distortion through graph coloring. In: ISIT \u201907: Proceedings of the IEEE International Symposium on Information Theory, pp. 1501\u20131505 (2007)"},{"issue":"4","key":"9371_CR14","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of lnn for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"9371_CR15","doi-asserted-by":"crossref","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 40(4), 219\u2013234 (2004)","journal-title":"Algorithmica"},{"key":"9371_CR16","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/978-3-540-77050-3_7","volume-title":"FSTTCS \u201907: Proceedings of the 27th International Conference on Foundations of Software Technology and Theoretical Computer Science","author":"T. Fukunaga","year":"2007","unstructured":"Fukunaga, T., Halld\u00f3rsson, M.M., Nagamochi, H.: \u201cRent-or-buy\u201d scheduling and cost coloring problems. In: FSTTCS \u201907: Proceedings of the 27th International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 84\u201395 (2007)"},{"key":"9371_CR17","first-page":"1204","volume-title":"SODA \u201908: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"T. Fukunaga","year":"2008","unstructured":"Fukunaga, T., Halld\u00f3rsson, M.M., Nagamochi, H.: Robust cost colorings. In: SODA \u201908: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1204\u20131212 (2008)"},{"issue":"2","key":"9371_CR18","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebr. Discrete Methods 1(2), 216\u2013227 (1980)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"3","key":"9371_CR19","doi-asserted-by":"crossref","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. Rech. Op\u00e9r. 41(3), 275\u2013287 (2007)","journal-title":"RAIRO. Rech. Op\u00e9r."},{"issue":"2","key":"9371_CR20","doi-asserted-by":"crossref","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. Bioinform. 5(2), 252\u2013261 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"9371_CR21","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18(1), 145\u2013163 (1997)","journal-title":"Algorithmica"},{"issue":"2\u20133","key":"9371_CR22","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 348(2\u20133), 240\u2013250 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9371_CR23","series-title":"Cambridge Mathematical Library","volume-title":"Inequalities","author":"G.H. Hardy","year":"1988","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1988). Reprint of the 1952 edition"},{"key":"9371_CR24","doi-asserted-by":"crossref","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\u2212\u03f5 . Acta Math. 182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"9371_CR25","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. 33, 143\u2013153 (1981)","journal-title":"Congr. Numer."},{"key":"9371_CR26","first-page":"411","volume-title":"Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes","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, pp. 411\u2013425. Academia, Prague (1973). Dedicated to the memory of Anton\u00edn \u0160pa\u010dek"},{"issue":"6","key":"9371_CR27","doi-asserted-by":"crossref","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. Inf. Theory 44(6), 2207\u20132229 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9371_CR28","doi-asserted-by":"crossref","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. Inf. Theory 49(1), 99\u2013111 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9371_CR29","doi-asserted-by":"crossref","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. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9371_CR30","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.orl.2004.07.006","volume":"33","author":"D. Marx","year":"2005","unstructured":"Marx, D.: A short proof of the NP-completeness of minimum sum interval coloring. Oper. Res. Lett. 33(4), 382\u2013384 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9371_CR31","doi-asserted-by":"crossref","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 23(2), 109\u2013126 (1999)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"9371_CR32","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 381(1\u20133), 183\u2013196 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9371_CR33","first-page":"562","volume-title":"SODA \u201904: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"S.V. Pemmaraju","year":"2004","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.: Buffer minimization using max-coloring. In: SODA \u201904: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 562\u2013571 (2004)"},{"key":"9371_CR34","doi-asserted-by":"crossref","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 Syst. Tech. J. 27, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"9371_CR35","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1090\/dimacs\/020\/08","volume-title":"Combinatorial Optimization","author":"G. Simonyi","year":"1995","unstructured":"Simonyi, G.: Graph entropy: a survey. In: Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 399\u2013441 (1995)"},{"issue":"1","key":"9371_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A. Tucker","year":"1980","unstructured":"Tucker, A.: An efficient test for circular-arc graphs. SIAM J. Comput. 9(1), 1\u201324 (1980)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9371_CR37","doi-asserted-by":"crossref","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. 24(2), 133\u2013137 (1987)","journal-title":"Inf. Process. Lett."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9371-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9371-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9371-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:23Z","timestamp":1558684463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9371-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,23]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9371"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9371-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,23]]}}}