{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:33Z","timestamp":1725551133544},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006237"},{"type":"electronic","value":"9783540364948"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36494-3_38","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:04Z","timestamp":1269897124000},"page":"427-438","source":"Crossref","is-referenced-by-count":5,"title":["Alternative Algorithms for Counting All Matchings in Graphs"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Sankowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/(SICI)1098-2418(1999010)14:1<29::AID-RSA2>3.0.CO;2-X","volume":"14","author":"A. Barvinok","year":"1999","unstructured":"Alexander Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures and Algorithms 14 (1999), 29\u201361.","journal-title":"Random Structures and Algorithms"},{"key":"38_CR2","unstructured":"Alexander Barvinok, New Permanent Estimators Via Non-Commutative Determinants, preprint."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"J. van den Berg and R. Brouwer, Random Sampling for the Monomer-Dimer Model on a Lattice, 1999 CWI Research Report.","DOI":"10.1063\/1.533198"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Isabel Beichl and Francis Sullivan, Approximating the Permanent via Importance Sampling with Application to Dimer Covering Problem, Journal of computational Physics 149, 1, February 1999.","DOI":"10.1006\/jcph.1998.6149"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Steve Chien, Lars Rasmussen and Alistair Sinclair, Clifford Algebras and Approximating the Permanent, Proceedings of the 34th ACM Symposium on Theory of Computing, 2001, 712\u2013721.","DOI":"10.1145\/509907.509944"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01294460","volume":"15","author":"A. Frieze","year":"1995","unstructured":"A. Frieze and M. Jerrum, An analysis of a Monte Carlo algorithm for estimating the permanent, Combinatorica, 15 (1995), 67\u201383.","journal-title":"Combinatorica"},{"issue":"II","key":"38_CR7","first-page":"241","volume":"I","author":"C.D. Godsil","year":"1981","unstructured":"C.D. Godsil and I. Gutman, On the matching polynomial of a graph, Algebraic Methods in Graph Theory, Vol. I, II, (Szeged, 1978), North-Holland, Amsterdam-New York, 1981, 241\u2013249.","journal-title":"Algebraic Methods in Graph Theory"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF01877590","volume":"25","author":"O. J. Heilmann","year":"1972","unstructured":"Ole J. Heilmann, Elliott H.Lieb, Theory of Monomer-Dimer Systems, Communications in mathematical Physics 25 (1972), 190\u2013232.","journal-title":"Communications in mathematical Physics"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"Mark Jerrum and Alistair Sinclair, Approximating the permanent, SIAM Journal on Computing 18 (1989), 1149\u20131178.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR10","unstructured":"Mark Jerrum and Alistair Sinclair, The Markow Chain Monte Carlo method: an approach to approximate counting and integration, in Approximation Algorithms for NP-hard Problems (Dorit Hochbaum, ed.),PWS 1996."},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Mark Jerrum, Alistair Sinclair and Eric Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, Electronic Colloquium on Computational Complexity, Report No. 79 (2000).","DOI":"10.1145\/380752.380877"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1137\/0222021","volume":"22","author":"N. Karmarkar","year":"1993","unstructured":"N. Karmarkar, R. Karp, R. Lipton, L. Lov\u00e1sz and M. Luby, A Monte Carlo algorithm for estimating the permanent, SIAM Journal on Computing22 (1993), 284\u2013293.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/rsa.3240050208","volume":"5","author":"L. E. Rasmussen","year":"1994","unstructured":"Lars Eilstrup Rasmussen, Approximating the Permanent: a Simple Approach, Random Structures Algorithms 5 (1994), 349\u2013361.","journal-title":"Random Structures Algorithms"}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36494-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T09:57:37Z","timestamp":1685527057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006237","9783540364948"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}