{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T22:24:22Z","timestamp":1771367062900,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf02684400","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T01:05:36Z","timestamp":1186535136000},"page":"1-16","source":"Crossref","is-referenced-by-count":4,"title":["Massively parallel augmenting path algorithms for the assignment problem"],"prefix":"10.1007","volume":"59","author":[{"given":"S.","family":"Stor\u00f8y","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"S\u00f8revik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02684400_CR1","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BF01584237","volume":"21","author":"D. Bertsekas","year":"1981","unstructured":"Bertsekas, D.: A new algorithm for the assignment problem. Math. Programm.21, 152\u2013171 (1981).","journal-title":"Math. Programm."},{"key":"BF02684400_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"D. Bertsekas","year":"1988","unstructured":"Bertsekas, D.: The auction algorithm: A distributed relaxation method for the assignment problem. Ann. Oper. Res.14, 105\u2013123 (1988).","journal-title":"Ann. Oper. Res."},{"key":"BF02684400_CR3","unstructured":"Brady, M. L., Jung, K. K., Nguyen, H. T., Raghavan, R., Subramonian, R.: The assignment problem on parallel architectures. In: Proceedings of the Dimacs Implementation Challenge Workshop at Rutgers University, 1991."},{"key":"BF02684400_CR4","doi-asserted-by":"crossref","unstructured":"Blank, T.: The maspar mp-1 architecture. In: Proceedings of IEEE Compcon Spring 1990. IEEE, February 1990.","DOI":"10.1109\/CMPCON.1990.63648"},{"key":"BF02684400_CR5","unstructured":"Christy, P.: Software to support massively parallel computing on the maspar mp-1. In: Proceedings of IEEE Compcon Spring 1990. IEEE, February 1990."},{"key":"BF02684400_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02288323","volume":"13","author":"G. Carpaneto","year":"1988","unstructured":"Carpaneto, G., Martello, S., Toth, P.: Algorithms and codes for the assignment problem. Ann. Oper. Res.13, 193\u2013223 (1988).","journal-title":"Ann. Oper. Res."},{"key":"BF02684400_CR7","unstructured":"Castanon, D. A., Smith, B., Wilson, A.: Performance of parallel assignments algorithms on different multiprocessor architectures. Technical Report TP-1245, Alphatech, INC., 1989."},{"key":"BF02684400_CR8","series-title":"Technical Report Version 1.0 DRAFT","volume-title":"High performance fortran, language specification","author":"High Performance Fortran Forum","year":"1993","unstructured":"High Performance Fortran Forum. High performance fortran, language specification. Technical Report Version 1.0 DRAFT, Rice University, Houston Texas, 1993."},{"key":"BF02684400_CR9","unstructured":"Herland, B.G.: Mpvms \u2014 maspar virtual memory system. Technical Report Report 73, Dept. of Informatics, University of Bergen, 1992."},{"key":"BF02684400_CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing38, 325\u2013340 (1987).","journal-title":"Computing"},{"key":"BF02684400_CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H. W. Kuhn","year":"1955","unstructured":"Kuhn, H. W.: The Hungarian method for the assignment problem. Naval Res. Logistics Q.2, 83\u201397 (1955).","journal-title":"Naval Res. Logistics Q."},{"key":"BF02684400_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/ijoc.3.4.299","volume":"3","author":"J. L. Kennington","year":"1991","unstructured":"Kennington, J. L., Wang, Z.: An empirical analysis of the dense assignment problem: Sequential and parallel implementations. ORSA J. Comput.3, 299\u2013306 (1991).","journal-title":"ORSA J. Comput."},{"key":"BF02684400_CR13","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L.: Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976."},{"key":"BF02684400_CR14","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J. Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problem. SIAM J. Comput.5, 32\u201338 (1957).","journal-title":"SIAM J. Comput."},{"key":"BF02684400_CR15","doi-asserted-by":"crossref","unstructured":"Nickolls, J.: The design of the maspar mp-1, a cost effective massively parallel computer. In: Proceedings of IEEE Compcon Spring 1990. IEEE, February 1990.","DOI":"10.1109\/CMPCON.1990.63649"},{"key":"BF02684400_CR16","unstructured":"Prechelt, L.: Measurement of maspar mp-1216a communication operations. Technical Report 01\/93, Institut f\u00fcr Programmstrukturen und Datenorganisation, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1993."},{"key":"BF02684400_CR17","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Englewood Cliffs: Prentice-Hall, 1982."},{"key":"BF02684400_CR18","volume-title":"Proceedings from NOAS \u201993","author":"T. S\u00f8revik","year":"1993","unstructured":"S\u00f8revik, T.: Average case complexity analysis of algorithms for the linear assignment problem. In: Proceedings from NOAS \u201993. Univ. of Trondheim, Norway, 1993."},{"key":"BF02684400_CR19","unstructured":"Stor\u00f8y, S., S\u00f8revik, T.: An. simd., fine-grained, parallel algorithm for the dense linear assignment problem. Technical Report Report 72, Dept. of Informatics, University of Bergen, 1992."},{"key":"BF02684400_CR20","doi-asserted-by":"crossref","unstructured":"Wein, J. M., Zenios, S.: Massively parallel auction algorithms for the assignment problem. Technical Report MIT\/LCS\/TM-438, Laboratory for Comp. Science, MIT, 1990.","DOI":"10.21236\/ADA230847"},{"key":"BF02684400_CR21","series-title":"Technical Report","volume-title":"A comparison of two algorithms for the assignment problem","author":"H. Zaki","year":"1990","unstructured":"Zaki, H.: A comparison of two algorithms for the assignment problem. Technical Report ORL 90-002, Dept. of Mechanical and Industrial Engineering, Univ. of Illinois, Urbana-Champaign, Urbana, Il 61801, 1990."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684400.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02684400\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T18:22:38Z","timestamp":1558203758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02684400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF02684400"],"URL":"https:\/\/doi.org\/10.1007\/bf02684400","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}