{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T05:25:24Z","timestamp":1700717124985},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":[[1995,3]]},"DOI":"10.1016\/0020-0190(94)00216-l","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:21:54Z","timestamp":1027599714000},"page":"333-336","source":"Crossref","is-referenced-by-count":9,"title":["On the point-to-point connection problem"],"prefix":"10.1016","volume":"53","author":[{"given":"Madan","family":"Natu","sequence":"first","affiliation":[]},{"given":"Shu-Cherng","family":"Fang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00216-L_BIB1","series-title":"Contributions to Operations Research and Economics","first-page":"251","article-title":"Two-terminal Steiner tree polyhedra","author":"Ball","year":"1989"},{"key":"10.1016\/0020-0190(94)00216-L_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0020-0190(94)00216-L_BIB3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","article-title":"The Steiner problem in graphs","volume":"1","author":"Dreyfus","year":"1972","journal-title":"Networks"},{"key":"10.1016\/0020-0190(94)00216-L_BIB4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00216-L_BIB5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/trsc.24.4.245","article-title":"Routing in point-to-point delivery systems: Formulation and solution heuristics","volume":"24","author":"Leung","year":"1991","journal-title":"Transportation Sci."},{"key":"10.1016\/0020-0190(94)00216-L_BIB6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(92)90258-C","article-title":"The point-to-point delivery and connection problems: Complexity and algorithms","volume":"36","author":"Li","year":"1992","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400216L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400216L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T00:55:02Z","timestamp":1556240102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400216L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["002001909400216L"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00216-l","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}