{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:39:50Z","timestamp":1770503990688,"version":"3.49.0"},"reference-count":41,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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":7563,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0166-218x(92)90021-2","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"45-72","source":"Crossref","is-referenced-by-count":103,"title":["Steiner's problem in graphs: heuristic methods"],"prefix":"10.1016","volume":"40","author":[{"given":"Stefan","family":"Vo\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90021-2_BIB1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","article-title":"An integer linear programming approach to the Steiner problem in graphs","volume":"10","author":"Aneja","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90021-2_BIB2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230170107","article-title":"Problem reduction methods and a tree generation algorithm for the Steiner network problem","volume":"17","author":"Balakrishnan","year":"1987","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90021-2_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","article-title":"An algorithm for the Steiner problem in graphs","volume":"14","author":"Beasley","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90021-2_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","article-title":"An SST-based algorithm for the Steiner problem in graphs","volume":"19","author":"Beasley","year":"1989","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90021-2_BIB5","series-title":"Proceedings of the IEEE International Symposium on Circuits and Systems","first-page":"1217","article-title":"New algorithms for Steiner tree on graphs","author":"Chen","year":"1983"},{"key":"10.1016\/0166-218X(92)90021-2_BIB6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1051\/ro\/1978120202071","article-title":"Une heuristique pour le probleme de l'arbre de Steiner","volume":"12","author":"Choukhmane","year":"1978","journal-title":"RAIRO Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(92)90021-2_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(89)90005-9","article-title":"An edge elimination test for the Steiner problem in graphs","volume":"8","author":"Duin","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(92)90021-2_BIB8","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/net.3230190506","article-title":"Reduction tests for the Steiner problem in graphs","volume":"19","author":"Duin","year":"1989","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90021-2_BIB9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1080\/03052158308960625","article-title":"Steiner problems in graphs: algorithms and applications","volume":"7","author":"Foulds","year":"1983","journal-title":"Engrg. Optimization"},{"key":"10.1016\/0166-218X(92)90021-2_BIB10","series-title":"Ph.D. thesis","article-title":"Le probl\u00e8me de l'arbre de Steiner","author":"Guyard-Daher","year":"1985"},{"key":"10.1016\/0166-218X(92)90021-2_BIB11","series-title":"Proceedings of the Third International Conference on Genetic Algorithms","first-page":"231","article-title":"Optimization of Steiner trees using genetical algorithms","author":"Hesser","year":"1989"},{"key":"10.1016\/0166-218X(92)90021-2_BIB12","series-title":"Optimization of Connection Structures in Graphs","first-page":"57","article-title":"Some notes on the Steiner tree problem in graphs","author":"Iwainsky","year":"1985"},{"key":"10.1016\/0166-218X(92)90021-2_BIB13","article-title":"The Steiner problem on directed graphs: a probabilistic analysis of the duality gap","author":"Jain","year":"1989","journal-title":"NATO Advanced Research Workshop on Topological Network Design"},{"key":"10.1016\/0166-218X(92)90021-2_BIB14","series-title":"Technologie, Wachstum und Besch\u00e4ftigung - Festschrift f\u00fcr Lothar Sp\u00e4th","first-page":"582","article-title":"Zur Bedeutung der diskreten Mathematik f\u00fcr die Konstruktion hochintegrierter Schaltkreise","author":"Korte","year":"1987"},{"key":"10.1016\/0166-218X(92)90021-2_BIB15","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF00264613","article-title":"On efficient implementation of an approximation algorithm for the Steiner tree problem","volume":"27","author":"Kou","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(92)90021-2_BIB16","first-page":"147","article-title":"An even faster approximation algorithm for the Steiner tree problem in graphs","volume":"59","author":"Kou","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(92)90021-2_BIB17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(92)90021-2_BIB18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0166-218X(92)90021-2_BIB19","series-title":"Mathematical Foundations of Computer Science","first-page":"501","article-title":"Near optimal algorithms for finding minimum Steiner trees on random graphs","volume":"233","author":"Kucera","year":"1986"},{"key":"10.1016\/0166-218X(92)90021-2_BIB20","article-title":"Combinatorial Heuristic Algorithms with FORTRAN","volume":"280","author":"Lau","year":"1986"},{"key":"10.1016\/0166-218X(92)90021-2_BIB21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","article-title":"A faster approximation algorithm for the Steiner problem in graphs","volume":"27","author":"Mehlhorn","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90021-2_BIB22","series-title":"Ph. D. thesis","article-title":"Contribution to solve the Steiner problem in a directed graph: a heuristic method","author":"Palma-Pacheco","year":"1985"},{"key":"10.1016\/0166-218X(92)90021-2_BIB23","first-page":"155","article-title":"A bound for the Steiner tree problem in graphs","volume":"31","author":"Plesnik","year":"1981","journal-title":"Math. Slovaca"},{"key":"10.1016\/0166-218X(92)90021-2_BIB24","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 Tech. J."},{"key":"10.1016\/0166-218X(92)90021-2_BIB25","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/0020739830140103","article-title":"The computation of nearly minimal Steiner trees in graphs","volume":"14","author":"Rayward-Smith","year":"1983","journal-title":"Internat. J. Math. Ed. Sci. Tech."},{"key":"10.1016\/0166-218X(92)90021-2_BIB26","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/net.3230160305","article-title":"On finding Steiner vertices","volume":"16","author":"Rayward-Smith","year":"1986","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90021-2_BIB27","series-title":"Optimization of Connection Structures in Graphs","first-page":"91","article-title":"Thermodynamically motivated simulation for solving the Steiner tree problem and the optimization of interacting path systems","author":"Schiemangk","year":"1985"},{"key":"10.1016\/0166-218X(92)90021-2_BIB28","first-page":"21","article-title":"Heuristic algorithms for rectilinear Steiner trees","volume":"7","author":"Servit","year":"1981","journal-title":"Digital Processes"},{"key":"10.1016\/0166-218X(92)90021-2_BIB29","first-page":"237","article-title":"The Steiner tree problem on graph and its heuristic algorithm","volume":"8","author":"Shaohan","year":"1985","journal-title":"Chinese J. Comput."},{"key":"10.1016\/0166-218X(92)90021-2_BIB30","series-title":"Tech. Rep. 249","article-title":"Approximation algorithms for Steiner tree problems","author":"Sullivan","year":"1982"},{"key":"10.1016\/0166-218X(92)90021-2_BIB31","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi","year":"1980","journal-title":"Math. Japon."},{"key":"10.1016\/0166-218X(92)90021-2_BIB32","first-page":"239","article-title":"A reduction based algorithm for the Steiner problem in graphs","volume":"58","author":"Vo\u00df","year":"1989"},{"key":"10.1016\/0166-218X(92)90021-2_BIB33","series-title":"Steiner-Probleme in Graphen","author":"Vo\u00df","year":"1990"},{"key":"10.1016\/0166-218X(92)90021-2_BIB34","series-title":"Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science","first-page":"387","article-title":"A multiple source algorithm for suboptimum Steiner trees in graphs","author":"Wang","year":"1985"},{"key":"10.1016\/0166-218X(92)90021-2_BIB35","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0020-0190(88)90225-6","article-title":"Worst-case performance of Rayward-Smith's Steiner tree heuristic","volume":"29","author":"Waxman","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90021-2_BIB36","series-title":"Fast approximation algorithms for Steiner's problem in graphs","author":"Widmayer","year":"1986"},{"key":"10.1016\/0166-218X(92)90021-2_BIB37","series-title":"Graph-Theoretic Concepts in Computer Science","first-page":"17","article-title":"On approximation algorithms for Steiner's problem in graphs","volume":"246","author":"Widmayer","year":"1987"},{"key":"10.1016\/0166-218X(92)90021-2_BIB38","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks: a survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90021-2_BIB39","doi-asserted-by":"crossref","unstructured":"P. Winter and J. MacGregor Smith, Path-distance heuristics for the Steiner problem in undirected networks, Algorithmica, to appear.","DOI":"10.1007\/BF01758765"},{"key":"10.1016\/0166-218X(92)90021-2_BIB40","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","article-title":"A dual ascent approach for Steiner tree problems on a directed graph","volume":"28","author":"Wong","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90021-2_BIB41","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF00289500","article-title":"A faster approximation algorithm for the Steiner problem in graphs","volume":"23","author":"Wu","year":"1986","journal-title":"Acta Inform."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900212?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900212?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:23:51Z","timestamp":1554967431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92900212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["0166218X92900212"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90021-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}