{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:59:32Z","timestamp":1754485172127},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"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":9786,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1986,10]]},"DOI":"10.1016\/0012-365x(86)90040-3","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"49-57","source":"Crossref","is-referenced-by-count":26,"title":["Hexagonal coordinate systems and steiner minimal trees"],"prefix":"10.1016","volume":"62","author":[{"given":"F.K.","family":"Hwang","sequence":"first","affiliation":[]},{"given":"J.f.","family":"Weng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(86)90040-3_BIB1","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1137\/0118014","article-title":"On the efficiency of the algorithm for Steiner minimal trees","volume":"18","author":"Cockayne","year":"1970","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(86)90040-3_BIB2","doi-asserted-by":"crossref","unstructured":"D.Z. Du, F.K. Hwang, and J.F. Weng, Steiner minimal trees for regular polygons, Comput. and Discrete Geom., to appear.","DOI":"10.1007\/BF02187871"},{"key":"10.1016\/0012-365X(86)90040-3_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","article-title":"Steiner minimal trees","volume":"16","author":"Gilbert","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(86)90040-3_BIB4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","article-title":"On the problem of Steiner","volume":"4","author":"Melzak","year":"1961","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(86)90040-3_BIB5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(86)90008-8","article-title":"A linear algorithm for full Steiner trees","volume":"4","author":"Hwang","year":"1986","journal-title":"O.R. Letters"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86900403?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86900403?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:53:38Z","timestamp":1553946818000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X86900403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["0012365X86900403"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(86)90040-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}