{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:07Z","timestamp":1725544747272},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_21","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"190-201","source":"Crossref","is-referenced-by-count":1,"title":["Random Bichromatic Matchings"],"prefix":"10.1007","author":[{"given":"Nayantara","family":"Bhatnagar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Randall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay V.","family":"Vazirani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Vigoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1214\/aop\/1176989121","volume":"21","author":"R. Burton","year":"1993","unstructured":"Burton, R., Pemantle, R.: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances. Annals of Probability\u00a021(3), 1329\u20131371 (1993)","journal-title":"Annals of Probability"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1103\/PhysRev.124.1664","volume":"124","author":"M.E. Fisher","year":"1961","unstructured":"Fisher, M.E.: Statistical Mechanics of Dimers on a Plane Lattice. Phys. Rev.\u00a0124, 1664\u20131672 (1961)","journal-title":"Phys. Rev."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1039\/tf9373301272","volume":"33","author":"R.H. Fowler","year":"1937","unstructured":"Fowler, R.H., Rushbrooke, G.S.: Statistical theory of perfect solutions. Transactions of the Faraday Society\u00a033, 1272\u20131294 (1937)","journal-title":"Transactions of the Faraday Society"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF01877590","volume":"25","author":"O.J. Heilmann","year":"1972","unstructured":"Heilmann, O.J., Leib, E.H.: Theory of monomer-dimer systems. Communications in Mathematical Physics\u00a025, 190\u2013232 (1972)","journal-title":"Communications in Mathematical Physics"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the Permanent. SIAM Journal of Computing\u00a018, 1149\u20131178 (1989)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A Polynomial-Time Approximation Algorithm for the permanent of a matrix with non-negative entries. Journal of the ACM\u00a051(4), 671\u2013697 (2004)","journal-title":"Journal of the ACM"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M. Jerrum","year":"1986","unstructured":"Jerrum, M., Valiant, L., Vazirani, V.: Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science\u00a043, 169\u2013188 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"21_CR8","first-page":"8","volume":"23","author":"A.V. Karzanov","year":"1987","unstructured":"Karzanov, A.V.: Maximum Matching of given weight in complete and complete bipartite graphs. Kibernetica: 7-11, English translation in CYBNAW\u00a023(1), 8\u201313 (1987)","journal-title":"Kibernetica: 7-11, English translation in CYBNAW"},{"key":"21_CR9","first-page":"1209","volume":"27","author":"P.W. Kasteleyn","year":"1961","unstructured":"Kasteleyn, P.W.: The statistics of dimers on a lattice, I. The number of dimer arrangements on a quadratic lattice. Physica\u00a027, 1209\u20131225 (1961)","journal-title":"The number of dimer arrangements on a quadratic lattice. Physica"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/BF02183743","volume":"83","author":"C. Kenyon","year":"1996","unstructured":"Kenyon, C., Randall, D., Sinclair, A.: Approximating the number of monomerdimer coverings of a lattice. Journal of Statistical Physics\u00a083, 637\u2013659 (1996)","journal-title":"Journal of Statistical Physics"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica\u00a07(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/B978-0-12-566780-7.50023-4","volume-title":"Progress in Combinatorial Optimization","author":"C. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.: Polytopes and Complexity. In: Pulleyblank, W.R. (ed.) Progress in Combinatorial Optimization, pp. 295\u2013305. Academic Press, Canada (1984)"},{"key":"21_CR13","unstructured":"Temperley, H.N.V.: Combinatorics, Proceedings of the British Combinatorial Conference 1973. London Mathematical Society Lecture Notes Series, vol.\u00a013, pp. 202\u2013204 (1974)"},{"issue":"1-3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0166-218X(01)00300-6","volume":"121","author":"T. Yi","year":"2002","unstructured":"Yi, T., Murty, K.G., Spera, C.: Matchings in colored bipartite networks. Discrete Applied Mathematics\u00a0121(1-3), 261\u2013277 (2002)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T16:21:25Z","timestamp":1548433285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11682462_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}