{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:48Z","timestamp":1760245008504,"version":"build-2065373602"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3760,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0893-9659(03)80063-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T18:40:50Z","timestamp":1052764850000},"page":"395-399","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connectivity calculus"],"prefix":"10.1016","volume":"16","author":[{"given":"D.","family":"Cieslik","sequence":"first","affiliation":[]},{"given":"A.","family":"Dress","sequence":"additional","affiliation":[]},{"given":"K.T.","family":"Huber","sequence":"additional","affiliation":[]},{"given":"V.","family":"Moulton","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(03)80063-0_BIB1","unstructured":"D. Cieslik, A. Dress, K.T. Huber and V. Moulton, Embedding complexity: A new divide & conquer approach to discrete optimization, exemplified by the Steiner tree problem, (submitted)."},{"year":"1998","series-title":"Steiner Minimal Trees","author":"Cieslik","key":"10.1016\/S0893-9659(03)80063-0_BIB2"},{"key":"10.1016\/S0893-9659(03)80063-0_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","article-title":"Steiner's problem in graphs and its implications","volume":"1","author":"Hakimi","year":"1971","journal-title":"Networks"},{"year":"1992","series-title":"The Steiner Tree Problem","author":"Hwang","key":"10.1016\/S0893-9659(03)80063-0_BIB4"},{"key":"10.1016\/S0893-9659(03)80063-0_BIB5","series-title":"Annotated Bibliographies in Combinatorial Optimization","first-page":"335","article-title":"Network connectivity","author":"Raghavan","year":"1997"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965903800630?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965903800630?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:08:11Z","timestamp":1760238491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965903800630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0893965903800630"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(03)80063-0","relation":{},"ISSN":["0893-9659"],"issn-type":[{"type":"print","value":"0893-9659"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Connectivity calculus","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(03)80063-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}