{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:12Z","timestamp":1759063572161},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00088-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"1-7","source":"Crossref","is-referenced-by-count":6,"title":["A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem"],"prefix":"10.1016","volume":"59","author":[{"given":"Gurmeet Singh","family":"Manku","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00088-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(96)00088-9_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(96)00088-9_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 neighbourhood graphs","volume":"39","author":"Chang","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(96)00088-9_BIB4","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/322077.322086","article-title":"The bottleneck traveling salesman problem: Algorithms and probabilistic analysis","volume":"25","author":"Garfinkel","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00088-9_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(96)00088-9_BIB6","first-page":"478","article-title":"On k-nearest neighbor Voronoi diagram in the plane","volume":"31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(96)00088-9_BIB7","series-title":"Minimum weight two-connected spanning networks","year":"1985"},{"key":"10.1016\/0020-0190(96)00088-9_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0167-6377(84)90077-4","article-title":"Guaranteed performance heuristics for the bottleneck traveling salesman problem","volume":"2","author":"Parker","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(96)00088-9_BIB9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0167-6377(92)90069-F","article-title":"Traveling salesman problem under categorization","volume":"12","author":"Punnen","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(96)00088-9_BIB10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0020-0190(94)00041-7","article-title":"A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem","volume":"50","author":"Punnen","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00088-9_BIB11","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:0020019096000889?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000889?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T14:20:15Z","timestamp":1584109215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000889"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00088-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}