乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T08:43:00Z","timestamp":1722760980650},"reference-count":38,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research"],"published-print":{"date-parts":[[2020,1]]},"abstract":" Optimal Recovery of a Hidden Hamiltonian Cycle with Applications in Genome Sequencing <\/jats:p>","DOI":"10.1287\/opre.2019.1886","type":"journal-article","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T17:34:41Z","timestamp":1577986481000},"page":"53-70","source":"Crossref","is-referenced-by-count":13,"title":["Hidden Hamiltonian Cycle Recovery via Linear Programming"],"prefix":"10.1287","volume":"68","author":[{"given":"Vivek","family":"Bagaria","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, California 94305;"}]},{"given":"Jian","family":"Ding","sequence":"additional","affiliation":[{"name":"Department of Statistics, The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104;"}]},{"given":"David","family":"Tse","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, California 94305;"}]},{"given":"Yihong","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Statistics and Data Science, Yale University, New Haven, Connecticut 06511;"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6104-4742","authenticated-orcid":false,"given":"Jiaming","family":"Xu","sequence":"additional","affiliation":[{"name":"Fuqua School of Business, Duke University, Durham, North Carolina 27708"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"crossref","unstructured":"Abbe E, Sandon C (2015) Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms. Proc. 2015 IEEE 56th Annual Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 670\u2013688.","DOI":"10.1109\/FOCS.2015.47"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1244-x"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795285771"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.12.3.253"},{"key":"B9","doi-asserted-by":"crossref","unstructured":"Barak B, Hopkins SB, Kelner JA, Kothari P, Moitra A, Potechin A (2016) A nearly tight sum-of-squares lower bound for the planted clique problem. Proc. IEEE 57th Annual Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 428\u2013437.","DOI":"10.1109\/FOCS.2016.53"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1137\/090753115"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1007\/s101079900102"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240050303"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2703102"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2011.tm10314"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0_6"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"B21","doi-asserted-by":"crossref","unstructured":"Cvetkovi\u0107 D, \u010cangalovi\u0107 M, Kova\u010devi\u0107-Vuj\u010di\u0107 V (1999) Semidefinite programming methods for the symmetric traveling salesman problem. Cornu\u00e9jols G, Burkard RE, Woeginger GJ, eds. Proc. Internat. Conf. Integer Programming Combin. Optim. (Springer, Berlin), 126\u2013136.","DOI":"10.1007\/3-540-48777-8_10"},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1137\/070711141"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"B28","first-page":"1016","volume":"26","author":"Fogel F","year":"2013","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2594812"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"issue":"2","key":"B38","first-page":"104","volume":"17","author":"Kendall DG","year":"1971","journal-title":"Probab. Theory Related Fields"},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1137\/060664793"},{"key":"B42","first-page":"2168","volume":"27","author":"Lim CH","year":"2014","journal-title":"Advances in Neural Information Processing Systems"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/060"},{"key":"B44","doi-asserted-by":"publisher","DOI":"10.2307\/2333244"},{"key":"B46","doi-asserted-by":"crossref","unstructured":"McSherry F (2001) Spectral partitioning of random graphs. Proc. 42nd IEEE Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 529\u2013537.","DOI":"10.1109\/SFCS.2001.959929"},{"key":"B47","doi-asserted-by":"crossref","unstructured":"Meka R, Potechin A, Wigderson A (2015) Sum-of-squares lower bounds for planted clique. Proc. 47th Annual ACM Sympos. Theory Comput. (ACM, New York), 87\u201396.","DOI":"10.1145\/2746539.2746600"},{"key":"B48","doi-asserted-by":"crossref","unstructured":"Mossel E, Neeman J, Sly A (2015) Consistency thresholds for the planted bisection model. Proc. 47th Annual ACM Sympos. Theory Comput. (ACM, New York), 69\u201375.","DOI":"10.1145\/2746539.2746603"},{"key":"B49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2270273"},{"key":"B52","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188582"},{"key":"B53","doi-asserted-by":"publisher","DOI":"10.1101\/gr.193474.115"},{"key":"B54","unstructured":"R\u00e9nyi A (1961) On measures of entropy and information. Proc. 4th Berkeley Sympos. Math. Statist. Probab., vol. 1: Contributions Theory Statist. (University of California Press, Berkeley), 547\u2013561."},{"key":"B55","doi-asserted-by":"publisher","DOI":"10.2307\/276978"},{"key":"B56","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0608"},{"key":"B57","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","volume":"24","author":"Schrijver A","year":"2003"},{"key":"B60","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1428"},{"key":"B61","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009795911987"}],"container-title":["Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/opre.2019.1886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T21:11:08Z","timestamp":1680469868000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/opre.2019.1886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1287\/opre.2019.1886"],"URL":"https:\/\/doi.org\/10.1287\/opre.2019.1886","relation":{},"ISSN":["0030-364X","1526-5463"],"issn-type":[{"value":"0030-364X","type":"print"},{"value":"1526-5463","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}