{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T12:18:24Z","timestamp":1682425104401},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,6,28]],"date-time":"2014-06-28T00:00:00Z","timestamp":1403913600000},"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":["Comput Stat"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00180-014-0506-1","type":"journal-article","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T18:31:06Z","timestamp":1403893866000},"page":"1793-1798","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Permanents, $$\\alpha $$ \u03b1 -permanents and Sinkhorn balancing"],"prefix":"10.1007","volume":"29","author":[{"given":"Francis","family":"Sullivan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"Beichl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,28]]},"reference":[{"key":"506_CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0024-3795(89)90580-6","volume":"115","author":"T Ando","year":"1989","unstructured":"Ando T (1989) Majorization, doubly stocastic matrices and comparison of eigenvalues. Linear Algebra Appl 115:163\u2013248","journal-title":"Linear Algebra Appl"},{"key":"506_CR2","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1006\/jcph.1998.6149","volume":"149","author":"I Beichl","year":"1999","unstructured":"Beichl I, Sullivan F (1999) Approximating the permanent via importance sampling with application to the dimer covering problem. J Comput Phys 149:128\u2013147","journal-title":"J Comput Phys"},{"key":"506_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Dor A, Halevi S (1993) Zero-one permanent is #p-complete, a simpler proof. In: Proceedings of the 2nd Israel symposium on the theory and computing systems, pp 108\u2013117","DOI":"10.1109\/ISTCS.1993.253457"},{"key":"506_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.2140\/pjm.1967.21.343","volume":"21","author":"P Knopp","year":"1967","unstructured":"Knopp P, Sinkhorn R (1967) Concerning non-negative matrices and doubly stochastic matrices. Pac J Math 21:343\u2013348","journal-title":"Pac J Math"},{"key":"506_CR5","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1093\/biomet\/asp036","volume":"96","author":"S Kou","year":"2009","unstructured":"Kou S, McCullagh P (2009) Approximating the $$\\alpha $$ \u03b1 permanent. Biometrika 96:635\u2013644","journal-title":"Biometrika"},{"key":"506_CR6","volume-title":"Monte Carlo strategies in scientific computing","author":"JS Liu","year":"2001","unstructured":"Liu JS (2001) Monte Carlo strategies in scientific computing. Springer, New York"},{"key":"506_CR7","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1214\/aoms\/1177703591","volume":"35","author":"R Sinkhorn","year":"1964","unstructured":"Sinkhorn R (1964) A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann Math Stat 35:876\u2013879","journal-title":"Ann Math Stat"},{"key":"506_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(91)90157-R","volume":"150","author":"G Soules","year":"1991","unstructured":"Soules G (1991) The rate of convergence of sinkhorn balancing. Linear Algebra Appl 150:3\u201340","journal-title":"Linear Algebra Appl"},{"key":"506_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1:146\u2013160","journal-title":"SIAM J Comput"},{"key":"506_CR10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.tcs.2011.12.071","volume":"423","author":"T Tassa","year":"2012","unstructured":"Tassa T (2012) Finding all maximally-matchable edges in a bipartite graph. Theor Comput Sci 423:50\u201358","journal-title":"Theor Comput Sci"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-014-0506-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00180-014-0506-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-014-0506-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:31:22Z","timestamp":1565569882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00180-014-0506-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,28]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s00180-014-0506-1","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,28]]}}}