{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:04:42Z","timestamp":1775070282706,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000,1]]},"DOI":"10.1016\/s0020-0190(99)00160-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:19:59Z","timestamp":1027617599000},"page":"17-21","source":"Crossref","is-referenced-by-count":48,"title":["Performance guarantees for the TSP with a parameterized triangle inequality"],"prefix":"10.1016","volume":"73","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[]},{"given":"Chandra","family":"Chekuri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00160-X_ID006","series-title":"On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality","author":"Andreae","year":"1998"},{"issue":"1","key":"10.1016\/S0020-0190(99)00160-X_ID007","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480192240226","article-title":"Performance guarantees for approximation algorithms depending on parametrized triangle inequalities","volume":"Vol. 8","author":"Andreae","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(99)00160-X_ID008","series-title":"Proc. 37th IEEE Symposium on Foundations of Computer Science","first-page":"2","article-title":"Polynomial-time approximation schemes for Euclidean TSP and other geometric problems","author":"Arora","year":"1996"},{"key":"10.1016\/S0020-0190(99)00160-X_ID009","series-title":"Worst-case analysis of a new heuristic for the Traveling Salesman Problem","author":"Christofides","year":"1976"},{"issue":"3","key":"10.1016\/S0020-0190(99)00160-X_ID010","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1008023416823","article-title":"Relaxing the triangle inequality in pattern matching","volume":"Vol. 30","author":"Fagin","year":"1998","journal-title":"Internat. J. Comput. Vision"},{"key":"10.1016\/S0020-0190(99)00160-X_ID011","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0095-8956(74)90090-2","article-title":"On spanning subgraphs of a connected bridgeless graph and their application to DT graphs","volume":"Vol. 16","author":"Fleischner","year":"1974","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/S0020-0190(99)00160-X_ID012","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0095-8956(74)90091-4","article-title":"The square of every two-connected graph is Hamiltonian","volume":"Vol. 16","author":"Fleischner","year":"1974","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/S0020-0190(99)00160-X_ID013","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1006\/jagm.1996.0052","article-title":"Improved approximation algorithms for uniform connectivity problems","volume":"Vol. 21","author":"Khuller","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(99)00160-X_ID014","series-title":"Finding a Hamiltonian cycle in the square of a block","author":"Lau","year":"1980"},{"key":"10.1016\/S0020-0190(99)00160-X_ID015","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01564847","article-title":"Finding EPS-graphs","volume":"Vol. 92","author":"Lau","year":"1981","journal-title":"Monatshefte f\u00fcr Math."},{"issue":"4","key":"10.1016\/S0020-0190(99)00160-X_ID016","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1137\/S0097539796309764","article-title":"Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems","volume":"Vol. 28","author":"Mitchell","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(99)00160-X_ID017","series-title":"Proc. SPIE Conf. on Storage and Retrieval for Image and Video Databases, Vol. 1908","first-page":"173","article-title":"The QBIC project: Querying images by content using color, texture, and shape","author":"Niblack","year":"1993"},{"issue":"1","key":"10.1016\/S0020-0190(99)00160-X_ID018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","article-title":"The traveling salesman problem with distances one and two","volume":"Vol. 18","author":"Papadimitriou","year":"1993","journal-title":"Math. Oper. Res."},{"issue":"6","key":"10.1016\/S0020-0190(99)00160-X_ID019","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":"Vol. 2","author":"Parker","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0020-0190(99)00160-X_ID020","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jagm.1995.0800","article-title":"Improved approximation algorithms for weighted 2 & 3 vertex connectivity augmentation problems","volume":"Vol. 22","author":"Penn","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(99)00160-X_ID021","first-page":"137","article-title":"On an ordering of the set of vertices of a connected graph","volume":"Vol. 412","author":"Sekanina","year":"1960","journal-title":"Publ. Faculty of Sci. Univ. Brno"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909900160X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909900160X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:21:42Z","timestamp":1556158902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909900160X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S002001909900160X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00160-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}