{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T10:21:57Z","timestamp":1758190917453,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["OPG 0008085","OPG 0170381"],"award-info":[{"award-number":["OPG 0008085","OPG 0170381"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1016\/s0020-0190(98)00094-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"105-110","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph"],"prefix":"10.1016","volume":"67","author":[{"given":"Jeffrey Mark","family":"Phillips","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.N.","family":"Kabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00094-5_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","article-title":"Halin graphs and the traveling salesman problem","volume":"16","author":"Cornu\u00e9jols","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/S0020-0190(98)00094-5_BIB2","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","article-title":"Bottleneck extrema","volume":"8","author":"Edmonds","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0020-0190(98)00094-5_BIB3","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\/S0020-0190(98)00094-5_BIB4","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinational Optimization","article-title":"Well solved special cases","author":"Gilmore","year":"1985"},{"key":"10.1016\/S0020-0190(98)00094-5_BIB5","series-title":"Combinational Mathematics and Its Applications","first-page":"129","article-title":"Studies on minimally n-connected graphs","author":"Halin","year":"1971"},{"key":"10.1016\/S0020-0190(98)00094-5_BIB6","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\/S0020-0190(98)00094-5_BIB7","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":"1994","journal-title":"Oper. Research Lett."},{"article-title":"The bottleneck traveling salesman problem on a Halin graph and extensions","year":"1997","author":"Phillips","key":"10.1016\/S0020-0190(98)00094-5_BIB8"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000945?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000945?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T04:29:24Z","timestamp":1758083364000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0020019098000945"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00094-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1998,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(98)00094-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}