{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:16:56Z","timestamp":1648523816729},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4460,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0304-3975(00)00016-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:59:17Z","timestamp":1027580357000},"page":"323-339","source":"Crossref","is-referenced-by-count":0,"title":["Approximation of some NP-hard optimization problems by finite machines, in probability"],"prefix":"10.1016","volume":"259","author":[{"given":"Dawei","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Camille","family":"Birget","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00016-5_BIB1","first-page":"357","article-title":"Weighted sums of certain dependent variables","volume":"3","author":"Azuma","year":"1965","journal-title":"Tohoku Math. J."},{"key":"10.1016\/S0304-3975(00)00016-5_BIB2","series-title":"Approximation Algorithms for NP-hard Problems","first-page":"46","article-title":"Approximation algorithms for bin packing: a survey","author":"Coffman","year":"1997"},{"key":"10.1016\/S0304-3975(00)00016-5_BIB3","series-title":"Probabilistic Analysis of Packing and Partitioning Algorithms","author":"Coffman","year":"1991"},{"key":"10.1016\/S0304-3975(00)00016-5_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0890-5401(91)90025-W","article-title":"Completeness in approximation classes","volume":"93","author":"Crescenzi","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00016-5_BIB5","series-title":"Probability Theory and Mathematical Statistics (Translation of Rachunek prawdopodobienstwa i statystyka matematyczna, by R. Bartoszynski)","author":"Fisz","year":"1980"},{"key":"10.1016\/S0304-3975(00)00016-5_BIB6","series-title":"Empirical Processes, Lecture Note \u2013 Monograph Series, Vol. 3, Institute of Mathematical Statistics","author":"Gaenssler","year":"1983"},{"key":"10.1016\/S0304-3975(00)00016-5_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0167-6377(95)00053-4","article-title":"Probabilistic analysis of a bin covering algorithm","volume":"18","author":"Han","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0304-3975(00)00016-5_BIB8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1965","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0304-3975(00)00016-5_BIB9","doi-asserted-by":"crossref","unstructured":"D. Hong, J.C. Birget, Probabilistic approximation of some NP optimization problems by finite-state machines, in: J. Rolim (Ed.), Randomization and Approximation Techniques in Computer Science (RANDOM\u201997), Lecture Notes in Computer Science, Vol. 1269, Springer, Berlin, July, 1997, pp. 151\u2013164. RANDOM\u201997.","DOI":"10.1007\/3-540-63248-4_13"},{"key":"10.1016\/S0304-3975(00)00016-5_BIB10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0020-0190(95)00044-D","article-title":"Probabilistic analysis of k-dimensional packing algorithms","volume":"55","author":"Hong","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00016-5_BIB11","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(00)00016-5_BIB12","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00016-5_BIB13","first-page":"168","volume":"Vol. 539","author":"Kingman","year":"1976"},{"key":"10.1016\/S0304-3975(00)00016-5_BIB14","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000165?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000165?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T06:21:00Z","timestamp":1556778060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0304397500000165"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00016-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}