{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T23:47:26Z","timestamp":1695685646852},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T00:00:00Z","timestamp":1422921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s11222-015-9546-9","type":"journal-article","created":{"date-parts":[[2015,2,2]],"date-time":"2015-02-02T12:35:26Z","timestamp":1422880526000},"page":"591-607","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sequential Monte Carlo for counting vertex covers in general graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Radislav","family":"Vaisman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zdravko I.","family":"Botev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ad","family":"Ridder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,3]]},"reference":[{"key":"9546_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69033-9","volume-title":"Stochastic Simulation: Algorithms and Analysis. Applications of Mathematics","author":"S Asmussen","year":"2007","unstructured":"Asmussen, S., Glynn, P.W.: Stochastic Simulation: Algorithms and Analysis. Applications of Mathematics. Springer, New York (2007)"},{"key":"9546_CR2","first-page":"487","volume":"6","author":"J Blitzstein","year":"2010","unstructured":"Blitzstein, J., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6, 487\u2013520 (2010)","journal-title":"Internet Math."},{"key":"9546_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs. Cambridge Studies in Advanced Mathematics","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (2001)"},{"key":"9546_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11222-010-9201-4","volume":"22","author":"Z Botev","year":"2012","unstructured":"Botev, Z., Kroese, D.: Efficient Monte Carlo simulation via the generalized splitting method. Stat. Comput. 22, 1\u201316 (2012)","journal-title":"Stat. Comput."},{"key":"9546_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1198\/016214504000001303","volume":"100","author":"Y Chen","year":"2005","unstructured":"Chen, Y., Diaconis, P., Holmes, S.P., Liu, J.S.: Sequential Monte Carlo methods for statistical analysis of tables. J. Am. Stat. Assoc. 100, 109\u2013120 (2005)","journal-title":"J. Am. Stat. Assoc."},{"key":"9546_CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0022-0000(03)00014-X","volume":"67","author":"M Cryan","year":"2003","unstructured":"Cryan, M., Dyer, M.: A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. J. Comput. Syst. Sci. 67, 291\u2013310 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"9546_CR7","doi-asserted-by":"crossref","unstructured":"Dechter, R., Gogate, V.: A new algorithm for sampling CSP solutions uniformly at random. In: Principles and Practice of Constraint Programming (May 2006)","DOI":"10.1007\/11889205_56"},{"key":"9546_CR8","doi-asserted-by":"crossref","unstructured":"Dyer, M.: Approximate counting by dynamic programming. In: Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 693\u2013699 (2003)","DOI":"10.1145\/780542.780643"},{"key":"9546_CR9","doi-asserted-by":"crossref","unstructured":"Dyer, M., Frieze, A., Jerrum, M.: On counting independent sets in sparse graphs. In: 40th Annual Symposium on Foundations of Computer Science, pp. 210\u2013217 (1999)","DOI":"10.1109\/SFFCS.1999.814593"},{"key":"9546_CR10","unstructured":"Gogate, V., Dechter, R.: Approximate counting by sampling the backtrack-free search space. In: Proceedings of the 22nd National Conference on Artificial Intelligence, vol. 1. AAAI\u201907, pp. 198\u2013203. AAAI Press, Menlo Park (2007)"},{"key":"9546_CR11","unstructured":"Gomes, C.P., Hoffmann, J., Sabharwal, A., Selman, B.: From sampling to model counting. In: IJCAI, pp. 2293\u20132299 (2007)"},{"key":"9546_CR12","doi-asserted-by":"crossref","unstructured":"Harary, F., Hayes, J.P., Wu, H.-J.: A survey of the theory of hypercube graphs. Comput. Math. Appl. 15(4), 277\u2013289 (1988)","DOI":"10.1016\/0898-1221(88)90213-1"},{"key":"9546_CR13","first-page":"482","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"M Jerrum","year":"1996","unstructured":"Jerrum, M., Sinclair, A.: The Markov chain Monte Carlo method: an approach to approximate counting and integration. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 482\u2013520. PWS Publishing, Pacific Grove (1996)"},{"key":"9546_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M Jerrum","year":"1986","unstructured":"Jerrum, M., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci. 43, 169\u2013188 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"9546_CR15","doi-asserted-by":"crossref","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. J. ACM 51(4), 671\u2013697 (2004)","DOI":"10.1145\/1008731.1008738"},{"key":"9546_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"9546_CR17","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Luby, M.: Monte-Carlo algorithms for enumeration and reliability problems. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science, SFCS \u201983, pp. 56\u201364. IEEE Computer Society, Washington, DC (1983)","DOI":"10.1109\/SFCS.1983.35"},{"key":"9546_CR18","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","volume":"10","author":"RM Karp","year":"1989","unstructured":"Karp, R.M., Luby, M., Madras, N.: Monte-Carlo approximation algorithms for enumeration problems. J. Algorithms 10, 429\u2013448 (1989)","journal-title":"J. Algorithms"},{"key":"9546_CR19","doi-asserted-by":"crossref","unstructured":"Liu, J., Lu, P.: FPTAS for counting monotone CNF. CoRR. http:\/\/arxiv.org\/abs\/1311.3728 (2013)","DOI":"10.1137\/1.9781611973730.101"},{"key":"9546_CR20","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Annual ACM IEEE Design Automation Conference, pp. 530\u2013535. ACM, New York (2001)","DOI":"10.1145\/378239.379017"},{"issue":"4","key":"9546_CR21","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<395::AID-RSA7>3.0.CO;2-U","volume":"11","author":"LE Rasmussen","year":"1997","unstructured":"Rasmussen, L.E.: Approximately counting cliques. Random Struct. Algorithms 11(4), 395\u2013411 (1997)","journal-title":"Random Struct. Algorithms"},{"key":"9546_CR22","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s11009-008-9101-7","volume":"11","author":"R Rubinstein","year":"2009","unstructured":"Rubinstein, R.: The Gibbs cloner for combinatorial optimization, counting and sampling. Methodol. Comput. Appl. Probab. 11, 491\u2013549 (2009)","journal-title":"Methodol. Comput. Appl. Probab."},{"issue":"2","key":"9546_CR23","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s11009-011-9242-y","volume":"15","author":"R Rubinstein","year":"2013","unstructured":"Rubinstein, R.: Stochastic enumeration method for counting NP-hard problems. Methodol. Comput. Appl. Probab. 15(2), 249\u2013291 (2013)","journal-title":"Methodol. Comput. Appl. Probab."},{"key":"9546_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9780470230381","volume-title":"Simulation and the Monte Carlo Method","author":"R Rubinstein","year":"2007","unstructured":"Rubinstein, R., Kroese, D.: Simulation and the Monte Carlo Method, 2nd edn. Wiley, New York (2007)","edition":"2"},{"issue":"6","key":"9546_CR25","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1080\/03610918.2012.625339","volume":"41","author":"R Rubinstein","year":"2012","unstructured":"Rubinstein, R., Dolgin, A., Vaisman, R.: The splitting method for decision making. Commun. Stat. Simul. Comput. 41(6), 905\u2013921 (2012)","journal-title":"Commun. Stat. Simul. Comput."},{"key":"9546_CR26","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: Seventh International Conference on Theory and Applications of Satisfiability Testing (2004)"},{"key":"9546_CR27","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31, 398\u2013427 (1997)","DOI":"10.1137\/S0097539797321602"},{"issue":"3","key":"9546_CR28","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9546-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-015-9546-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9546-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T12:30:24Z","timestamp":1566304224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-015-9546-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,3]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9546"],"URL":"https:\/\/doi.org\/10.1007\/s11222-015-9546-9","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,3]]}}}