{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:40:02Z","timestamp":1759138802315,"version":"3.44.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0167-9260(97)00019-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:27:12Z","timestamp":1027607232000},"page":"151-155","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Accuracy and fidelity of fast net length estimates"],"prefix":"10.1016","volume":"23","author":[{"given":"Joseph L.","family":"Ganley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-9260(97)00019-9_bib1","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-9260(97)00019-9_bib2","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/43.476573","article-title":"Near-optimal critical sink routing tree constructions","author":"Boese","year":"1995","journal-title":"IEEE Trans. Comput Aided Des."},{"key":"10.1016\/S0167-9260(97)00019-9_bib3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230090103","article-title":"The largest minimal rectilinear Steiner trees for a set of n points enclosed in a rectangular with given perimeter","volume":"9","author":"Chung","year":"1979","journal-title":"Networks"},{"year":"1990","author":"Cormen","series-title":"Introduction to Algorithms","key":"10.1016\/S0167-9260(97)00019-9_bib4"},{"key":"10.1016\/S0167-9260(97)00019-9_bib5","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","article-title":"On Steiner minimal trees with rectilinear distance","volume":"30","author":"Hwang","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-9260(97)00019-9_bib6","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell system Techn. J."},{"key":"10.1016\/S0167-9260(97)00019-9_bib7","article-title":"On performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension","volume":"11","author":"Kahng","year":"1992","journal-title":"IEEE Trans. Comput. Aided Des."},{"key":"10.1016\/S0167-9260(97)00019-9_bib8","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S0218195997000272","article-title":"Improved computation of optimal rectilinear Steiner minimal trees","volume":"7","author":"Ganley","year":"1997","journal-title":"Internat. J. Comput. Geometry Appl."},{"key":"10.1016\/S0167-9260(97)00019-9_bib9","series-title":"Proc. 4th Great Lakes Symp. on VLSI","first-page":"238","article-title":"A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees","author":"Ganley","year":"1994"},{"key":"10.1016\/S0167-9260(97)00019-9_bib10","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/43.144853","article-title":"A new class of iterative Steiner tree heuristics with good performance","volume":"11","author":"Kahng","year":"1992","journal-title":"IEEE Trans. Comput-Aided Des."},{"key":"10.1016\/S0167-9260(97)00019-9_bib11","series-title":"Proc. 16th Symp. on Theory of Computing","first-page":"342","article-title":"Fast expected-time and approximation algorithms for geometric minimum spanning trees","author":"Clarkson","year":"1984"},{"key":"10.1016\/S0167-9260(97)00019-9_bib12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230250206","article-title":"35-point rectilinear Steiner minimal trees in a day","volume":"25","author":"Salowe","year":"1995","journal-title":"Networks"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926097000199?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926097000199?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:12:12Z","timestamp":1759137132000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926097000199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0167926097000199"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(97)00019-9","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1997,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Accuracy and fidelity of fast net length estimates","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(97)00019-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}