{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T16:13:09Z","timestamp":1770480789587,"version":"3.49.0"},"reference-count":17,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6127,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1990,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.<\/jats:p>","DOI":"10.1002\/net.3230200110","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T08:18:44Z","timestamp":1178957924000},"page":"109-120","source":"Crossref","is-referenced-by-count":35,"title":["Faster exact algorithms for steiner trees in planar networks"],"prefix":"10.1002","volume":"20","author":[{"given":"Marshall","family":"Bern","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"B. S.Baker Approximation algorithms for NP\u2010complete problems on planar graphs. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (1983).","DOI":"10.1109\/SFCS.1983.7"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322095"},{"key":"e_1_2_1_4_2","unstructured":"M. W.Bern Network design problems: Steiner trees and spanning k\u2010trees. Ph. D. Thesis Computer Science Division University of California at Berkeley 1987."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0217004"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.4.634"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840357"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_2_1_11_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"key":"e_1_2_1_13_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_14_2","first-page":"1477","article-title":"Algorithm for the shortest connection of a group of graph vertices","volume":"12","author":"Levin A. J.","year":"1971","journal-title":"Soviet Math. Doklady"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180108"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120309"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170203"},{"key":"e_1_2_1_18_2","unstructured":"Y. Y.YangandO.Wing Optimal and suboptimal solution algorithms for the wiring problem.Proc. IEEE Int. Symp. Circuit Theory(1972)154\u2013158."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230200110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230200110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T09:28:13Z","timestamp":1697966893000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230200110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["10.1002\/net.3230200110"],"URL":"https:\/\/doi.org\/10.1002\/net.3230200110","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}