{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:42Z","timestamp":1725664542158},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594086"},{"type":"electronic","value":"9783540492450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_48","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:15:26Z","timestamp":1330258526000},"page":"145-156","source":"Crossref","is-referenced-by-count":1,"title":["The random linear bottleneck assignment problem"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Pferschy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"12_CR1","volume-title":"Handbook of Mathematical functions","author":"M. Abramowitz","year":"1965","unstructured":"M. Abramowitz, I.A. Stegun, Handbook of Mathematical functions, Dover Publications, New York, 1965."},{"key":"12_CR2","unstructured":"B. Bollob\u00e1s, Random Graphs, Academic Press, 1985."},{"key":"12_CR3","first-page":"47","volume":"28","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s, A. Thomason, Random graphs of small order. Random Graphs '83, Annals of Discrete Mathematics 28, 47\u201397, 1985.","journal-title":"Random Graphs '83, Annals of Discrete Mathematics"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02240182","volume":"33","author":"U. Derigs","year":"1984","unstructured":"U. Derigs, Alternate strategies for solving bottleneck assignment problems-analysis and computational results. Computing\n33, 95\u2013106, 1984.","journal-title":"Computing"},{"key":"12_CR5","volume-title":"Report 8609\/A","author":"J.B.G. Frenk","year":"1986","unstructured":"J.B.G. Frenk, M. van Houweninge, A.H.G. Rinnooy Kan, Order statistics and the linear assignment problem. Report 8609\/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands, 1986."},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","volume":"9","author":"H.N. Gabow","year":"1988","unstructured":"H.N. Gabow, R.E. Tarjan, Algorithms for two bottleneck optimization problems. J. of Algorithms\n9, 411\u2013417, 1988.","journal-title":"J. of Algorithms"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.3230100205","volume":"10","author":"R.M. Karp","year":"1980","unstructured":"R.M. Karp, An algorithm to solve the m \u00d7 n assignment problem in expected time O(mn log n). Networks\n10, 143\u2013152, 1980.","journal-title":"Networks"},{"key":"12_CR8","volume-title":"Technical report","author":"R.M. Karp","year":"1984","unstructured":"R.M. Karp, An upper bound on the expected cost of an optimal assignment. Technical report, Computer Science Division, Univ. of California, Berkeley, 1984."},{"key":"12_CR9","unstructured":"A.J. Lazarus, The assignment problem with uniform (0, 1) cost matrix. Master's thesis, Department of Mathematics, Princeton University, 1979."},{"key":"12_CR10","volume-title":"PhD-thesis","author":"B. Olin","year":"1992","unstructured":"B. Olin, Asymptotic properties of random assignment problems. PhD-thesis, Division of Optimization and Systems Theory, Department of Mathematics, Royal Institute of Technology, Stockholm, 1992."},{"key":"12_CR11","unstructured":"E.M. Palmer, Graphical Evolution, Wiley, 1985."},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","volume":"8","author":"D.W. Walkup","year":"1979","unstructured":"D.W. Walkup, On the expected value of a random assignment problem. SIAM J. Computing\n8, 440\u2013442, 1979.","journal-title":"SIAM J. Computing"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","volume":"31","author":"D.W. Walkup","year":"1980","unstructured":"D.W. Walkup, Matchings in random regular bipartite digraphs. Discrete Mathematics\n31, 59\u201364, 1980.","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59408-6_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:27:17Z","timestamp":1619558837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-59408-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}