{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:57:07Z","timestamp":1777424227023,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0166-218x(94)90039-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"91-93","source":"Crossref","is-referenced-by-count":44,"title":["Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem"],"prefix":"10.1016","volume":"55","author":[{"given":"Abraham P.","family":"Punnen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.P.K.","family":"Nair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90039-6_BIB1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(91)90195-N","article-title":"Computing maximum cardinality matching in a bipartite graph in time O (n1.5m\/log n),","volume":"37","author":"Alt","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)90039-6_BIB2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0167-6377(92)90103-A","article-title":"Solving linear bottleneck assignment problem via strong spanning trees","volume":"12","author":"Armstrong","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(94)90039-6_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02252026","article-title":"An augmenting path method for solving linear bottleneck assignment problems","volume":"19","author":"Derigs","year":"1978","journal-title":"Computing"},{"key":"10.1016\/0166-218X(94)90039-6_BIB4","article-title":"A production line assignment problem","author":"Fulkerson","year":"1953","journal-title":"RAND Research memo"},{"key":"10.1016\/0166-218X(94)90039-6_BIB5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","article-title":"Algorithms for two bottleneck optimization problems","volume":"9","author":"Gabow","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)90039-6_BIB6","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:29:32Z","timestamp":1555122572000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0166218X94900396"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90039-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}