{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:55:43Z","timestamp":1680436543065},"reference-count":3,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"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":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00104-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"235-242","source":"Crossref","is-referenced-by-count":6,"title":["Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems"],"prefix":"10.1016","volume":"91","author":[{"given":"Giovanni","family":"Righini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Trubian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00104-8_BIB1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/S0166-218X(98)00104-8_BIB2","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\/S0166-218X(98)00104-8_BIB3","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0377-2217(94)00010-A","article-title":"Worst-case analysis of two approximate algorithms for the Asymmetric Traveling Salesman Problem","volume":"81","author":"Righini","year":"1995","journal-title":"European J. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001048?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001048?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:52:56Z","timestamp":1556117576000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98001048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":3,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98001048"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00104-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}