{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:34:24Z","timestamp":1767339264182},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11035,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1983,5]]},"DOI":"10.1016\/0166-218x(83)90102-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"79-83","source":"Crossref","is-referenced-by-count":18,"title":["An extension of Christofides heuristic to the k-person travelling salesman problem"],"prefix":"10.1016","volume":"6","author":[{"given":"A.M.","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(83)90102-6_BIB1","series-title":"Management Sciences Research Report 388","article-title":"Worst-cast analysis of a new heuristic for the travelling salesman problem","author":"Christofides","year":"1976"},{"key":"10.1016\/0166-218X(83)90102-6_BIB2","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01588956","article-title":"Tight bounds for Christofides travelling salesman heuristic","volume":"14","author":"Corneujols","year":"1978","journal-title":"Mathematical Programming"},{"key":"10.1016\/0166-218X(83)90102-6_BIB3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","article-title":"Approximation algorithms for some postman problems","volume":"26","author":"Frederickson","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(83)90102-6_BIB4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","article-title":"Approximation algorithms for some routing problems","volume":"7","author":"Frederickson","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(83)90102-6_BIB5","first-page":"93","article-title":"Worst-case analysis of algorithms for the travelling salesman problem","volume":"32","author":"Frieze","year":"1979","journal-title":"Operations Res. Verfahren"},{"key":"10.1016\/0166-218X(83)90102-6_BIB6","series-title":"Combinatorial Programming Methods and Applications","first-page":"191","article-title":"Finding minimum spanning trees with a fixed number of links at a node","author":"Glover","year":"1975"},{"key":"10.1016\/0166-218X(83)90102-6_BIB7","series-title":"Combinatorial Optimisation: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(83)90102-6_BIB8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/SWAT.1974.4","article-title":"Approximate algorithms for the travelling salesman problem","author":"Rosenkrantz","year":"1974","journal-title":"Proc. 15th IEEE Symp. on Switching and Automata Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83901026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83901026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:02Z","timestamp":1555136762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X83901026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,5]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,5]]}},"alternative-id":["0166218X83901026"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(83)90102-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1983,5]]}}}