{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:46:32Z","timestamp":1759041992516},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":[[1996,12]]},"DOI":"10.1007\/bf02253463","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T14:46:16Z","timestamp":1132670776000},"page":"397-401","source":"Crossref","is-referenced-by-count":11,"title":["A fast algorithm for a class of bottleneck problems"],"prefix":"10.1007","volume":"56","author":[{"given":"A. P.","family":"Punnen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02253463_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading: Addison-Wesley 1974."},{"key":"BF02253463_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0167-6377(92)90103-A","volume":"12","author":"R. D. Armstrong","year":"1992","unstructured":"Armstrong, R. D., Jin, Z.: Solving linear bottleneck assignment problem via strong spanning trees. Oper. Res. Lett.12, 179\u2013180 (1992).","journal-title":"Oper. Res. Lett."},{"key":"BF02253463_CR3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"P. M. Camereni","year":"1978","unstructured":"Camereni, P. M.: The minimax spanning tree problem and some extensions, Inf. Proc. Lett.7, 10\u201314 (1978).","journal-title":"Inf. Proc. Lett."},{"key":"BF02253463_CR4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02252026","volume":"19","author":"U. Derigs","year":"1978","unstructured":"Derigs, U., Zimmerman, U.: An augmenting path method for solving linear bottleneck assignment problems. Computing19, 285\u2013298 (1978).","journal-title":"Computing"},{"key":"BF02253463_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J., Fulkerson, D. R.: Bottleneck extrema. J. Comb. Theory8, 299\u2013306 (1970).","journal-title":"J. Comb. Theory"},{"key":"BF02253463_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":"Gabow, H. N., Tarjan, R. E.: Algorithms for two bottleneck optimization problems. Algorithms9, 411\u2013417 (1988).","journal-title":"Algorithms"},{"key":"BF02253463_CR7","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/322077.322086","volume":"25","author":"R. S. Garfinkel","year":"1978","unstructured":"Garfinkel, R. S., Gilbert, K. C.: The bottleneck traveling salesman problem: algorithms and probabilistic analysis. J. ACM25, 435\u2013448 (1978).","journal-title":"J. ACM"},{"key":"BF02253463_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0020-0190(94)00041-7","volume":"50","author":"A. P. Punnen","year":"1994","unstructured":"Punnen, A. P., Nair, K. P. K.: A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem. Inf. Proc. Lett.50, 283\u2013286 (1994).","journal-title":"Inf. Proc. Lett."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02253463\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:52:25Z","timestamp":1558018345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02253463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF02253463"],"URL":"https:\/\/doi.org\/10.1007\/bf02253463","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}