{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:23:05Z","timestamp":1775665385255,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0020-0190(94)00041-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"283-286","source":"Crossref","is-referenced-by-count":8,"title":["A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem"],"prefix":"10.1016","volume":"50","author":[{"given":"Abraham P.","family":"Punnen","sequence":"first","affiliation":[]},{"given":"K.P.K.","family":"Nair","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00041-7_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(94)00041-7_BIB2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","article-title":"The minimax spanning tree problem and some extensions","volume":"7","author":"Camerini","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00041-7_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(92)90111-M","article-title":"Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs","volume":"39","author":"Chang","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(94)00041-7_BIB4","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/322077.322086","article-title":"The bottleneck travelling salesman problem: Algorithms and probabilistic analysis","volume":"25","author":"Garfinkel","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00041-7_BIB5","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","article-title":"A unified approach to approximation algorithms for bottleneck problems","volume":"33","author":"Hochbaum","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00041-7_BIB6","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","article-title":"On k-nearest neighbour Voronoi diagram in the plane","volume":"31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(94)00041-7_BIB7","article-title":"Minimum weight two-connected spanning networks","author":"Monma","year":"1985","journal-title":"Bell Communications Research"},{"key":"10.1016\/0020-0190(94)00041-7_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0167-6377(84)90077-4","article-title":"Guaranteed performance heuristics for the bottleneck travelling salesperson problem","volume":"2","author":"Parker","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(94)00041-7_BIB9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0167-6377(92)90069-F","article-title":"Travelling salesman problem under categorization","volume":"12","author":"Punnen","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(94)00041-7_BIB10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:50:41Z","timestamp":1555131041000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0020019094000417"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00041-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}