{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:47Z","timestamp":1759063847905},"reference-count":4,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00220-3","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"42-45","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract)"],"prefix":"10.1016","volume":"7","author":[{"given":"Andreas","family":"Baltz","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"Schoen","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00220-3_BIB1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02579135","article-title":"On optimal matchings","volume":"4","author":"Ajtai","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(04)00220-3_BIB2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comp. Sys. Sci."},{"key":"10.1016\/S1571-0653(04)00220-3_BIB3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","article-title":"The shortest path through many points","volume":"55","author":"Beardwood","year":"1959","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S1571-0653(04)00220-3_BIB4","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/S0097539792235384","article-title":"When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?","volume":"24","author":"Frieze","year":"1995","journal-title":"SIAM Journal on Computing"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002203?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002203?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T08:50:44Z","timestamp":1548579044000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304002203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":4,"alternative-id":["S1571065304002203"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00220-3","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}