{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:52:38Z","timestamp":1773150758306,"version":"3.50.1"},"reference-count":9,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9628,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1980,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We give an algorithm to solve the <jats:italic>m<\/jats:italic>\u2010source, <jats:italic>n<\/jats:italic>\u2010destination assignment problem in expected time <jats:italic>O(mn<\/jats:italic> log <jats:italic>n<\/jats:italic>) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The algorithm achieves its efficiency through an unusual application of priority queues.<\/jats:p>","DOI":"10.1002\/net.3230100205","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T11:37:14Z","timestamp":1178883434000},"page":"143-152","source":"Crossref","is-referenced-by-count":68,"title":["An algorithm to solve the <i>m<\/i> \u00d7 <i>n<\/i> assignment problem in expected time <i>O<\/i>(<i>mn<\/i> log <i>n<\/i>)"],"prefix":"10.1002","volume":"10","author":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.2.187"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_2_1_8_2","volume-title":"The Art of Computer Programming, Vol. 1, Fundamental Algorithms","author":"Knuth D. E.","year":"1968"},{"key":"e_1_2_1_9_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010206"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230100205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230100205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:19:15Z","timestamp":1699787955000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230100205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["10.1002\/net.3230100205"],"URL":"https:\/\/doi.org\/10.1002\/net.3230100205","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}