A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree that connects the input points, where it is possible to add new points to minimize the length of the tree. Solving the STP is of great importance since it is one of the fundamental problems in network design...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of parallel programming Ročník 42; číslo 2; s. 287 - 319
Hlavní autoři:	Bezensek, Mitja, Robic, Borut
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.04.2014 Springer Nature B.V
Témata:	Algorithms Approximation Biology Computation Computer networks Computer Science Distributed processing Graphs Heuristic Multicast Optimization Parallel processing Processor Architectures Ratios Routing (telecommunications) Software Engineering/Programming and Operating Systems Studies Theory of Computation Trees Wire Parallel computing Survey Applications Steiner tree Distributed computing Optimization
ISSN:	0885-7458, 1573-7640
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree that connects the input points, where it is possible to add new points to minimize the length of the tree. Solving the STP is of great importance since it is one of the fundamental problems in network design, very large scale integration routing, multicast routing, wire length estimation, computational biology, and many other areas. However, the STP is NP-hard, which shatters any hopes of finding a polynomial-time algorithm to solve the problem exactly. This is why the majority of research has looked at finding efficient heuristic algorithms. Additionally, many authors focused their work on utilizing the ever-increasing computational power and developed many parallel and distributed methods for solving the problem. In this way we are able to obtain better results in less time than ever before. Here, we present a survey of the parallel and distributed methods for solving the STP and discuss some of their applications.
AbstractList	Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree that connects the input points, where it is possible to add new points to minimize the length of the tree. Solving the STP is of great importance since it is one of the fundamental problems in network design, very large scale integration routing, multicast routing, wire length estimation, computational biology, and many other areas. However, the STP is NP-hard, which shatters any hopes of finding a polynomial-time algorithm to solve the problem exactly. This is why the majority of research has looked at finding efficient heuristic algorithms. Additionally, many authors focused their work on utilizing the ever-increasing computational power and developed many parallel and distributed methods for solving the problem. In this way we are able to obtain better results in less time than ever before. Here, we present a survey of the parallel and distributed methods for solving the STP and discuss some of their applications. Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree that connects the input points, where it is possible to add new points to minimize the length of the tree. Solving the STP is of great importance since it is one of the fundamental problems in network design, very large scale integration routing, multicast routing, wire length estimation, computational biology, and many other areas. However, the STP is NP-hard, which shatters any hopes of finding a polynomial-time algorithm to solve the problem exactly. This is why the majority of research has looked at finding efficient heuristic algorithms. Additionally, many authors focused their work on utilizing the ever-increasing computational power and developed many parallel and distributed methods for solving the problem. In this way we are able to obtain better results in less time than ever before. Here, we present a survey of the parallel and distributed methods for solving the STP and discuss some of their applications. Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree that connects the input points, where it is possible to add new points to minimize the length of the tree. Solving the STP is of great importance since it is one of the fundamental problems in network design, very large scale integration routing, multicast routing, wire length estimation, computational biology, and many other areas. However, the STP is NP-hard, which shatters any hopes of finding a polynomial-time algorithm to solve the problem exactly. This is why the majority of research has looked at finding efficient heuristic algorithms. Additionally, many authors focused their work on utilizing the ever-increasing computational power and developed many parallel and distributed methods for solving the problem. In this way we are able to obtain better results in less time than ever before. Here, we present a survey of the parallel and distributed methods for solving the STP and discuss some of their applications.[PUBLICATION ABSTRACT]
Author	Bezenšek, Mitja Robič, Borut
Author_xml	– sequence: 1 givenname: Mitja surname: Bezensek fullname: Bezensek, Mitja – sequence: 2 givenname: Borut surname: Robic fullname: Robic, Borut
BookMark	eNp9kE9LJDEQR4MoOOp-gL0FvHjptdKdf30cdF2FAQXdc6jprtZIpqNJekE__fYwexBhPdXlveLHO2L7YxyJse8CfggAc54FGK0rEE0FtWyq9z22EMo0ldES9tkCrFWVkcoesqOcnwGgNdYu2GrJ76f0h954HPgdJgyBAsex55c-l-TXU6GeL8NjTL48bTIfYuLlifh9IT9S4g-JiN-luA60OWEHA4ZM3_7dY_b76ufDxXW1uv11c7FcVV0j21IJQAWopTQDCsRaCQk1SmqwXw-i7nSnDSGortVo-kbVRko0A5G2_dBJ1Ryzs93flxRfJ8rFbXzuKAQcKU7ZCVVDa9tGixk9_YQ-xymN87qZmiOA1XZLmR3VpZhzosF1vmDxcSwJfXAC3Lay21V2c2W3rezeZ1N8Ml-S32B6-9Kpd06e2fGR0odN_5X-AgOkkKs
CODEN	IJPPE5
CitedBy_id	crossref_primary_10_1109_TPDS_2025_3563849 crossref_primary_10_1109_TAC_2019_2960265 crossref_primary_10_1007_s10766_021_00723_0 crossref_primary_10_1016_j_jnca_2017_12_011 crossref_primary_10_1016_j_tcs_2022_10_047 crossref_primary_10_1109_ACCESS_2020_3009318 crossref_primary_10_1002_net_22005
Cites_doi	10.1007/978-1-4613-0255-1_7 10.1137/0130013 10.1109/ICCIT.2008.167 10.1007/BF02114289 10.1007/BF01581256 10.1007/BF01758756 10.1109/TVLSI.2002.808463 10.1109/ICCAD.1991.185271 10.1109/90.234851 10.1007/3-540-45655-4_13 10.1023/A:1026546708757 10.1145/764809.764810 10.1145/1077464.1077470 10.1007/978-1-4684-2001-2_9 10.1080/03052159108941063 10.1109/GLSV.1993.224473 10.1137/0116001 10.1016/0097-3165(95)90055-1 10.1007/BF01758759 10.1016/j.parco.2006.09.002 10.1109/ICPADS.2007.4447726 10.1057/jors.1990.166 10.1016/0166-218X(92)90021-2 10.1080/0020739830140103 10.1016/j.asoc.2011.03.005 10.1007/3-540-44679-6_57 10.1007/978-3-540-24685-5_20 10.1002/net.20276 10.1109/RIVF.2008.4586329 10.1002/net.3230150305 10.1002/j.1538-7305.1957.tb01515.x 10.1016/S0305-0548(00)00029-0 10.1006/jagm.2000.1096 10.1145/1342171.1342174 10.1145/1541885.1541892 10.1023/A:1009758919736 10.1109/ICCAD.1990.129944 10.1002/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U 10.1007/978-1-4614-0311-1 10.1006/jcta.1996.0040 10.1070/RM1992v047n02ABEH000878 10.1109/MELCON.1996.551368 10.1007/978-1-4613-0255-1_6 10.1016/0020-0190(89)90039-2 10.1007/BF02430365 10.1145/331697.331752 10.1145/1185448.1185500 10.1007/978-1-4757-3171-2_6 10.1016/S0377-2217(99)00131-9 10.1002/net.3230010302 10.1145/357195.357200 10.1002/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7 10.1109/ICCD.2008.4751836 10.1002/net.3230260403 10.1016/S0304-3975(02)00414-0 10.1109/EURMIC.1994.390419 10.1016/j.parco.2005.09.006 10.1007/978-1-4757-3171-2 10.1016/j.cor.2003.12.007 10.1090/S0002-9939-1956-0078686-7 10.1126/science.220.4598.671 10.1109/90.490746 10.1145/290179.290180 10.1016/S0166-218X(99)00200-0 10.1007/BF02612335 10.1007/BF01187035 10.1142/6729 10.1007/PL00009201 10.1007/978-3-322-80291-0 10.1016/j.knosys.2006.04.012 10.1109/TCAD.1985.1270101 10.1007/3-540-40996-3_46 10.1109/TCAD.2004.826557 10.1007/s11277-010-9936-4 10.1007/BFb0018547 10.1006/jagm.2000.1086 10.1109/SFCS.1991.185402 10.1016/0305-0548(86)90048-1 10.1063/1.1699114 10.1145/276698.276868 10.1007/s00453-008-9254-3 10.1109/MWSCAS.2008.4616743
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2013 Springer Science+Business Media New York 2014
Copyright_xml	– notice: Springer Science+Business Media New York 2013 – notice: Springer Science+Business Media New York 2014
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8FD 8FE 8FG 8FK 8FL 8G5 ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L.0 L7M L~C L~D M0C M0N M2O MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI Q9U
DOI	10.1007/s10766-013-0243-z
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest ABI/INFORM Complete ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library (Alumni) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student ProQuest Research Library SciTech Premium Collection (Proquest) ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database (ProQuest) ABI/INFORM Professional Advanced ABI/INFORM Professional Standard Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Research Library (Proquest) Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic
DatabaseTitle	CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Research Library Prep Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College Research Library (Alumni Edition) ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ABI/INFORM Professional Standard ProQuest Central Korea ProQuest Research Library ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	Computer and Information Systems Abstracts ABI/INFORM Global (Corporate)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Biology
EISSN	1573-7640
EndPage	319
ExternalDocumentID	3225820141 10_1007_s10766_013_0243_z
Genre	Feature
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 2.D 203 28- 29J 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7WY 8FE 8FG 8FL 8G5 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYJJ AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFSI ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFO ACGFS ACHSB ACHXU ACIHN ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACPIV ACREN ACUHS ACZOJ ADHIR ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEAQA AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BKOMP BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO E.L EAD EAP EAS EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW LAK LLZTM M0C M0N M2O M4Y MA- MS~ N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 Q2X QOK QOS R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TAE TEORI TN5 TSG TSK TSV TUC TUS U2A U5U UG4 UOJIU UTJUX UZXMN VC2 VFIZW VXZ W23 W48 WH7 WK8 YLTOR Z45 Z7R Z7X Z81 Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L.0 L7M L~C L~D MBDVC PKEHL PQEST PQUKI Q9U
ID	FETCH-LOGICAL-c349t-10a50a6447fa1aa251402a4e3adbf12c6c67ea05c96a7d352744a7fee68dfc453
IEDL.DBID	RSV
ISICitedReferencesCount	13
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000331974200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0885-7458
IngestDate	Sun Nov 09 13:09:20 EST 2025 Tue Nov 04 19:40:58 EST 2025 Sat Nov 29 08:01:29 EST 2025 Tue Nov 18 22:24:58 EST 2025 Fri Feb 21 02:37:22 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Parallel computing Survey Applications Steiner tree Distributed computing Optimization
Language	English
License	http://www.springer.com/tdm
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c349t-10a50a6447fa1aa251402a4e3adbf12c6c67ea05c96a7d352744a7fee68dfc453
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
PQID	1500908681
PQPubID	48389
PageCount	33
ParticipantIDs	proquest_miscellaneous_1520989361 proquest_journals_1500908681 crossref_citationtrail_10_1007_s10766_013_0243_z crossref_primary_10_1007_s10766_013_0243_z springer_journals_10_1007_s10766_013_0243_z
PublicationCentury	2000
PublicationDate	2014-04-01
PublicationDateYYYYMMDD	2014-04-01
PublicationDate_xml	– month: 04 year: 2014 text: 2014-04-01 day: 01
PublicationDecade	2010
PublicationPlace	Boston
PublicationPlace_xml	– name: Boston – name: New York
PublicationTitle	International journal of parallel programming
PublicationTitleAbbrev	Int J Parallel Prog
PublicationYear	2014
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	PrömelHJStegerAThe Steiner tree problem2002GermanyFriedrick Vieweg and Son10.1007/978-3-322-80291-00992.68156 DuDHuXSteiner tree problem in computer communication networks2008SingaporeWorld Scientific10.1142/6729 BorradaileGKleinPNMathieuCSteiner tree in planar graphs: an O(n log n) approximation scheme with singly-exponential dependence on epsilonACM Trans. Algorithms20075313110.1145/1541885.15418922548259 Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and, Applied Mathematics, pp. 770–779 (2000) Zachariasen, M.: Algorithms for plane Steiner tree problems. Ph. d. University of Copenhagen (1998) WinterPAn algorithm for the Steiner problem in Euclidean planeNetworks19851532334510.1002/net.32301503050586.90087801493 InnamiN.KimB.MashikoY.ShiohamaK.The Steiner ratio conjecture of Gilbert-Pollak may still be openAlgorithmica200857869872 HollandJAdaptation in natural and artificial systems1975Ann Arbor, MIUniversity of Michigan Press SmithWDSmithJMGOn the Steiner ratio in 3-spaceJ. Comb. Theory Ser. A199569230133210.1016/0097-3165(95)90055-10831.05021 VaziraniVVApproximation algorithms2001BerlinSpringer Presti, G.L., Re, G.L., Storniolo, P., Urso, A.: A grid enabled parallel hybrid genetic algorithm for SPN. In: ICCS: Lecture Notes in Computer Science. Springer, pp. 156–163 (2004) DowslandKAHill-climbing simulated annealing and the Steiner problem in graphsEng. Optim.1991179110710.1080/03052159108941063 WongRichardTA dual ascent approach for steiner tree problems on a directed graphMath. Program.198428327128710.1007/BF026123350532.90092 WarmeDMWinterPZachariasenMExact algorithms for plane Steiner tree problems: a computational study2000DordrechtKluwer Academic Publishers Santos, M., Drummond, L.M.A., Uchoa, E.: Distributed Dual Ascent Algorithm for Steiner Problems in Networks. Anais do simpósio brasileiro de redes de computadores, pp. 381–394 (2007). http://www.sbrc2007.ufpa.br/Anais-SBRC2007.zip McKee, S.A., Barrera, T., Griffith, J., Robins, G., Zhang, T.: Toward a Steiner engine: enhanced serial and parallel implementations of the iterated 1-Steiner MRST algorithm. In: Proceedings of the Third Great Lakes Symposium on VLSI-Design Automation of High Performance VLSI Systems, vol. 2442, pp. 90–94 (1993) DuinCWVoßSEfficient path and vertex exchange in Steiner tree algorithmsNetworks1995298910510.1002/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7 Coulston, C.S.: Constructing exact octagonal Steiner minimal trees. In: GLSVLSI ’03: Proceedings of the 13th ACM Great Lakes Symposium on VLSI, ACM, pp. 1–6 (2003) GuhaSKhullerSApproximation algorithms for connected dominating setsAlgorithmica199820437438710.1007/PL000092010895.681061600830 OliveiraCPardalosPA survey of combinatorial optimization problems in multicast routingComput. Oper. Res.20053281953198110.1016/j.cor.2003.12.0071068.90027 BauerFVarmaADistributed algorithms for multicast path setup in data networksIEEE/ACM Trans. Netw.19964218119110.1109/90.490746 Di Fatta, G., Presti, G.L., Presti, G.L., Re, G.L., Re, G.L.: A parallel genetic algorithm for the steiner problem in networks. In: Proceedings of the 15th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2003) vol. 2, pp. 569–573 (2003) PrömelHJStegerAA new approximation algorithm for the Steiner tree problem with performance ratio 5/3J. Algorithms20003618910110.1006/jagm.2000.10860959.681011768992 Du, D.Z., Zhang, Y., Feng, Q.: On better heuristic for Euclidean Steiner minimum trees. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. pp. 431–439 (1991) GilbertENPollakHOSteiner minimal treesSIAM J. Appl. Math.19661612910.1137/0116001223269 ZelikovskyAAn 11/6-approximation algorithm for the network Steiner problemAlgorithmica1993946347010.1007/BF011870350768.681921212159 Bastos, M.P., Ribeiro, C.C.: Reactive tabu search with path-relinking for the Steiner problem in graphs. In: Proceedings of the Third Metaheuristics International Conference, pp. 31–36 (1999) Rugelj, J.: Distributed multicast routing mechanism for global point-to-point networks. In: Proceedings of Twentieth Euromicro Conference, System Architecture and Integration, pp. 389–395 (1994) Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Technical report, University of Virginia, Charlottesville, VA, USA (1996) KapsalisASmithGDRayward-SmithVJSolving the graphical Steiner tree problem using genetic algorithmsJ. Oper. Res. Soc.199326173185 Muhmmad, R.B.: Distributed Steiner tree algorithm and its application in ad hoc wireless networks. In: Proceedings of the 2006 International Conference on Wireless Networks (ICWN’06), pp. 173–178 (2006) ThimmMOn the approximability of the Steiner tree problemTheor. Comput. Sci.200329538740210.1016/S0304-3975(02)00414-01045.681071964676 Hougardy, S., Prömel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: SODA ’99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and, Applied Mathematics, pp. 448–453 (1999) LeightonFTIntroduction to parallel algorithms and architectures: array, trees, hypercubes1992San Mateo, CAMorgan Kaufmann Publishers Inc. Koch, T., Martin, A., Voß, S.: SteinLib: an updated library on Steiner problems in graphs (2000). http://steinlib.zib.de/bibdir/KMV00.bib GareyMRJohnsonDSComputers and Intractability. A Guide to the Theory of NP-Completeness1990San Francisco, CAW. H. Freeman & Co. NelsonNMMichelonPAdilsonXThe Euclidean Steiner tree problem in Rn: a mathematical programming formulationAnn. Oper. Res.200096122092201802523 Fobel, C., Grewal, G.: A parallel Steiner tree heuristic for macro cell routing. In: IEEE International Conference on Computer Design, vol. 27–33 (2008) KouLMarkowskyGBermanLA fast algorithm for Steiner treesActa Inf.1981154114510.1007/BF00288961599613 Herring, M.: The Euclidean Steiner Tree Problem (2004). http://www.denison.edu/academics/departments/mathcs/herring.pdf VoßSSteiner’s problem in graphs: heuristic methodsDiscret. Appl. Math.199240457210.1016/0166-218X(92)90021-20758.68032 BeasleyJEOR-Library: distributing test problems by electronic mailJ. Oper. Res. Soc.199041 10691072 RugeljJNovakRKandusGSteiner tree based distributed multicast routing in networks2000DordrechtKluwer Academic Publishers ZachariasenMLocal search for the Steiner tree problem in the Euclidean planeEur. J. Oper. Res.1999119228230010.1016/S0377-2217(99)00131-90933.900651675217 Ludwick, J.: A parallel and genetic approach to the Steiner tree extraction problem. Masters, Clemson University, Clemson, South Carolina (1996) Kahng, A., Robins, G.: A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach. In: IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, pp. 428–431 (1990) MartinsSLResendeMGCRibeiroCCPardalosPMA parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategyJ. Global Optim.200017126728310.1023/A:10265467087571044.900631807979 KirkpatrickSGelattCDVecchiMPOptimization by simulated annealingScience198322067168010.1126/science.220.4598.6711225.90162702485 Harris, Jr. F.C.: Parallel computation of steiner minimal trees. In: Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing, pp. 267–272 (2007) BernMPlassmannPThe Steiner problem with edge lengths 1 and 2Inf. Process. Lett.19893217117610.1016/0020-0190(89)90039-20677.680741015826 XuJChiuSYGloverFProbabilistic tabu search for telecommunications network designJ. Comb. Optim.199616994 VerhoevenMGASeverensMEMParallel local searchJ. Heuristics19951436510.1007/BF024303650853.68156 BouchachiaAProsseggerMA hybrid ensemble approach for the Steiner tree problem in large graphs: a geographical applicationAppl. Soft Comput.20111185745575410.1016/j.asoc.2011.03.005 KunZYongQHongZDynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problemKnowl Based Syst.200619755456410.1016/j.knosys.2006.04.012 Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972) HwangFKRichardsDSWinterPThe Steiner tree problem1992AmsterdamNorth Holland0774.05001 DreyfusSEWagnerRAThe Steiner tree problem in graphsNetworks1972119520710.1002/net.32300103020229.05125297107 AroraSPolynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJACM199845575378210.1145/290179.2901801064.90566 Martins, S.L., Ribeiro, C.C., Souza, M.C.: A parallel GRASP for the Steiner problem in graphs. In: IRREGULAR ’98: Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, pp. 285–297 (1998) TakahashiHMatsuyamaAAn approximation solution for the Steiner tree problem in graphsMath. Jpn.198224573577565542 ShenCCLiKJaikaeoCSridharaVAnt-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routingACM Trans. Auton. Adapt. Syst.20083112710.1145/1342171.1342174 GataniLLo ReGGaglioSAn efficient distributed algorithm for generating and updating multicast treesParallel Comput.20063211–1277779310.1016/j.parco.2006.09.002 DuDZSmithWDDisproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensionsJ. Comb. Theory Ser. A19967411513010.1006/jcta.1996.00400856.050251383508 Akbari, H., Iranmanesh, Z., Ghodsi, M.: Parallel Minimum Spanning Tree Heuristic for the Steiner problem in graphs. In: 2007 International Conference on Parallel and Distributed Systems, pp. 1–8 (2007) PapadimitriouCHSteiglitzKCombinatorial optimization: algorithms and complexity1998New YorkDover Publications0944.90066 Uchoa, E.: Algoritmos para problemas de Steiner com aplicaçaõ em projeto de circuitos VLSI. Ph. d. Catholic Un J Xu (243_CR59) 1996; 1 243_CR16 M Karpinski (243_CR12) 1997; 1 243_CR18 H Takahashi (243_CR52) 1982; 24 J Zhao (243_CR118) 2002; 10 CAS Oliveira (243_CR69) 2011 VJ Rayward-Smith (243_CR54) 1983; 14 DE Hewgill (243_CR91) 1992; 7 P Winter (243_CR90) 1985; 15 DM Warme (243_CR6) 2000 JB Kruskal Jr (243_CR20) 1956; 7 L Kou (243_CR55) 1981; 15 J Holland (243_CR63) 1975 243_CR24 S Kirkpatrick (243_CR65) 1983; 220 Y Handa (243_CR111) 2004 N Metropolis (243_CR66) 1953; 21 AO Ivanov (243_CR35) 1992; 47 FK Hwang (243_CR26) 1976; 30 243_CR9 H Esbensen (243_CR56) 1995; 26 EN Gilbert (243_CR7) 1966; 16 243_CR5 243_CR92 CH Papadimitriou (243_CR48) 1998 243_CR93 243_CR3 243_CR94 243_CR121 243_CR1 243_CR96 243_CR97 243_CR10 243_CR98 243_CR123 243_CR13 243_CR122 VV Vazirani (243_CR30) 2001 C Oliveira (243_CR68) 2005; 32 TH Cormen (243_CR51) 2001 243_CR39 WD Smith (243_CR25) 1995; 69 A Bouchachia (243_CR114) 2011; 11 DZ Du (243_CR22) 1992; 7 G Borradaile (243_CR50) 2007; 5 D Simchi-Levi (243_CR38) 1993; 59 JJ Salazar (243_CR44) 2000; 100 AE Dunlop (243_CR95) 1985; 4 243_CR116 243_CR115 WD Smith (243_CR37) 1992; 7 243_CR119 LMA Drummond (243_CR80) 2009; 53 243_CR40 FC Harris Jr (243_CR29) 1998; 30 243_CR41 243_CR42 243_CR113 L Gatani (243_CR75) 2006; 32 243_CR112 243_CR27 CC Ribeiro (243_CR105) 2000; 36 HJ Prömel (243_CR2) 2002 243_CR28 A Zelikovsky (243_CR8) 1993; 9 FK Hwang (243_CR32) 1992 243_CR107 F Bauer (243_CR53) 1996; 4 243_CR104 M Thimm (243_CR14) 2003; 295 S Voß (243_CR100) 1992; 40 VP Kompella (243_CR70) 1993; 1 243_CR109 243_CR108 C Kesselman (243_CR85) 1998 243_CR31 N Garg (243_CR45) 2000; 37 243_CR103 243_CR33 243_CR102 NM Nelson (243_CR36) 2000; 96 S Arora (243_CR34) 1998; 45 243_CR61 CC Shen (243_CR81) 2008; 3 S Guha (243_CR83) 1998; 20 243_CR49 J Xu (243_CR60) 1996; 6 FT Leighton (243_CR101) 1992 F Glover (243_CR64) 1986; 13 Z Kun (243_CR77) 2006; 19 L Drummond (243_CR84) 2006; 32 RichardT Wong (243_CR78) 1984; 28 M Zachariasen (243_CR110) 1999; 119 H Zhou (243_CR87) 2004; 23 SL Martins (243_CR106) 2000; 17 D Du (243_CR15) 2008 J Rugelj (243_CR67) 2000 M Bern (243_CR47) 1989; 32 MR Garey (243_CR46) 1990 M Resende (243_CR19) 1999 JE Beasley (243_CR117) 1990; 41 MGA Verhoeven (243_CR99) 1995; 1 A Kapsalis (243_CR57) 1993; 26 HJ Prömel (243_CR11) 2000; 36 A Zelikovsky (243_CR17) 1992; 60 243_CR86 RG Gallager (243_CR71) 1983; 5 DZ Du (243_CR23) 1996; 74 243_CR88 M Ilyas (243_CR120) 2003 RC Prim (243_CR21) 1957; 36 S Cinel (243_CR89) 2008; 27 KA Dowsland (243_CR62) 1991; 17 SE Dreyfus (243_CR4) 1972; 1 CW Duin (243_CR58) 1995; 29 JA Torkestani (243_CR82) 2010; 60 R Novak (243_CR74) 2001; 28 243_CR72 243_CR73 243_CR76 G Even (243_CR43) 2005; 1 243_CR79
References_xml	– reference: XuJChiuSGloverFUsing tabu search to solve Steiner tree-star problem in telecommunications network designTelecommun Syst1996611712510.1007/BF02114289 – reference: Ludwick, J.: A parallel and genetic approach to the Steiner tree extraction problem. Masters, Clemson University, Clemson, South Carolina (1996) – reference: DreyfusSEWagnerRAThe Steiner tree problem in graphsNetworks1972119520710.1002/net.32300103020229.05125297107 – reference: SalazarJJA note on the generalized Steiner tree polytopeDiscrete Appl. Math.20001001–213714410.1016/S0166-218X(99)00200-00947.900651733382 – reference: BauerFVarmaADistributed algorithms for multicast path setup in data networksIEEE/ACM Trans. Netw.19964218119110.1109/90.490746 – reference: GallagerRGHumbletPASpiraPMA distributed algorithm for minimum-weight spanning treesACM Trans. Program. Lang. Syst.19835667710.1145/357195.3572000498.68040 – reference: HewgillDECockayneEJImproved computation of plane Steiner minimal treesAlgorithmica1992721922910.1007/BF017587590756.050431146496 – reference: BeasleyJEOR-Library: distributing test problems by electronic mailJ. Oper. Res. Soc.199041 10691072 – reference: ThimmMOn the approximability of the Steiner tree problemTheor. Comput. Sci.200329538740210.1016/S0304-3975(02)00414-01045.681071964676 – reference: Du, D.Z., Wang, L., Xu, B.: The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points. In: COCOON ’01: Proceedings of the 7th Annual International Conference on Computing and Combinatorics, pp. 509–518. Springer, Berlin (2001) – reference: Chamberlain, B.: Graph partitioning algorithms for distributing workloads of parallel computations. Technical report (1998) – reference: GuhaSKhullerSApproximation algorithms for connected dominating setsAlgorithmica199820437438710.1007/PL000092010895.681061600830 – reference: TorkestaniJAMeybodiMRWeighted Steiner connected dominating set and its application to multicast routing in wireless MANETsWirel. Pers. Commun.201060214516910.1007/s11277-010-9936-4 – reference: BouchachiaAProsseggerMA hybrid ensemble approach for the Steiner tree problem in large graphs: a geographical applicationAppl. Soft Comput.20111185745575410.1016/j.asoc.2011.03.005 – reference: NelsonNMMichelonPAdilsonXThe Euclidean Steiner tree problem in Rn: a mathematical programming formulationAnn. Oper. Res.200096122092201802523 – reference: PapadimitriouCHSteiglitzKCombinatorial optimization: algorithms and complexity1998New YorkDover Publications0944.90066 – reference: GargNKonjevodGRaviRA polylogarithmic approximation algorithm for the group Steiner tree problemJ. Algorithms200037668410.1006/jagm.2000.10960962.681361783249 – reference: ResendeMPardalosPEksiogluSDParallel metaheuristics for combinatorial optimization1999DordrechtKluwer Academic Publishers – reference: KruskalJBJrOn the shortest spanning subtree of a graph and the traveling salesman problemProc. Am. Math. Soc.19567485010.1090/S0002-9939-1956-0078686-70070.1840478686 – reference: HarrisFCJrSteiner minimal trees: their computational past, present, and futureJ. Comb. Math. Combin. Comput.199830195220 – reference: DuDZSmithWDDisproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensionsJ. Comb. Theory Ser. A19967411513010.1006/jcta.1996.00400856.050251383508 – reference: CinelSBazlamacciCFA Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree ProblemComput. Aided Des.2008271120832087 – reference: Totsukawa, H., Senou, H., Ohmura, M.: A parallel genetic algorithm for 3-D rectilinear Steiner tree with bounded number of bends. In: 2008 51st Midwest Symposium on Circuits and Systems, pp. 89–92 (2008) – reference: Courant, R., Robbins, H.: What is mathematics? Oxford University Press, Oxford (1941) – reference: Muhmmad, R.B.: Distributed Steiner tree algorithm and its application in ad hoc wireless networks. In: Proceedings of the 2006 International Conference on Wireless Networks (ICWN’06), pp. 173–178 (2006) – reference: Berman, P., Ramaiye, V.: Improved approximations for the Steiner tree problem. In: SODA ’92: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and, Applied Mathematics, pp. 325–334 (1992) – reference: Uchoa, E.: Algoritmos para problemas de Steiner com aplicaçaõ em projeto de circuitos VLSI. Ph. d. Catholic Universtiy of Rio de Janeiro (2001) – reference: Koch, T., Martin, A., Voß, S.: SteinLib: an updated library on Steiner problems in graphs (2000). http://steinlib.zib.de/bibdir/KMV00.bib – reference: LeightonFTIntroduction to parallel algorithms and architectures: array, trees, hypercubes1992San Mateo, CAMorgan Kaufmann Publishers Inc. – reference: EvenGKortsarzGSlanyWOn network design problems: fixed cost flows and the covering steiner problemACM Trans. Algorithms2005117410110.1145/1077464.10774702163131 – reference: BorradaileGKleinPNMathieuCSteiner tree in planar graphs: an O(n log n) approximation scheme with singly-exponential dependence on epsilonACM Trans. Algorithms20075313110.1145/1541885.15418922548259 – reference: Fernández-Baca, D.: The perfect phylogeny problem. In: Du, D.Z., Pardalos, P.M. (eds.) Steiner Trees in Industry. Combinatorial Optimization, vol. 11, pp. 203–234. Kluwer Academic Publishers (2004) – reference: ShenCCLiKJaikaeoCSridharaVAnt-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routingACM Trans. Auton. Adapt. Syst.20083112710.1145/1342171.1342174 – reference: TakahashiHMatsuyamaAAn approximation solution for the Steiner tree problem in graphsMath. Jpn.198224573577565542 – reference: HwangFKOn Steiner minimal trees with rectilinear distanceSIAM J. Appl. Math.19763010411410.1137/01300130322.05101389632 – reference: Park, J.S., Ro, W.W., Lee, H., Park, N.: Parallel Algorithms for Steiner Tree Problem. In: 2008 Third International Conference on Convergence and Hybrid Information Technology, pp. 453–455 (2008) – reference: Pargas, R.P., Ludwick, J., Spoon, S.: Hybrid search algorithms. In: SAC ’97: Proceedings of the 1997 ACM symposium on Applied Computing, pp. 269–273 (1997) – reference: RibeiroCCDe SouzaMCTabu search for the Steiner tree problem in graphsNetworks20003613814610.1002/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U0960.900771793322 – reference: GareyMRJohnsonDSComputers and Intractability. A Guide to the Theory of NP-Completeness1990San Francisco, CAW. H. Freeman & Co. – reference: KapsalisASmithGDRayward-SmithVJSolving the graphical Steiner tree problem using genetic algorithmsJ. Oper. Res. Soc.199326173185 – reference: Jayaraman, R., Rutenbar, R.A.: A parallel Steiner heuristic for wirelength estimation of large net populations. In: 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers, pp. 344–347 (1991) – reference: WarmeDMWinterPZachariasenMExact algorithms for plane Steiner tree problems: a computational study2000DordrechtKluwer Academic Publishers – reference: IlyasMThe handbook of ad hoc wireless networks2003Boca Raton, FLCRC Press, Inc. – reference: GataniLLo ReGGaglioSAn efficient distributed algorithm for generating and updating multicast treesParallel Comput.20063211–1277779310.1016/j.parco.2006.09.002 – reference: Martins, S.L., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Quadratic assignment and related problems. In: DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237–261. American Mathematical Society (1994) – reference: RugeljJNovakRKandusGSteiner tree based distributed multicast routing in networks2000DordrechtKluwer Academic Publishers – reference: XuJChiuSYGloverFProbabilistic tabu search for telecommunications network designJ. Comb. Optim.199616994 – reference: Herring, M.: The Euclidean Steiner Tree Problem (2004). http://www.denison.edu/academics/departments/mathcs/herring.pdf – reference: Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Technical report, University of Virginia, Charlottesville, VA, USA (1996) – reference: InnamiN.KimB.MashikoY.ShiohamaK.The Steiner ratio conjecture of Gilbert-Pollak may still be openAlgorithmica200857869872 – reference: OliveiraCASPardalosPMMathematical Aspects of Network Routing Optimization2011BerlinSpringer10.1007/978-1-4614-0311-11225.90002 – reference: MetropolisNRosenbluthAWRosenbluthMNTellerAHTellerEEquation of state calculations by fast computing machinesJ. Chem. Phys.1953211087109210.1063/1.1699114 – reference: DrummondLMASantosMUchoaEA distributed dual ascent algorithm for Steiner problems in multicast routingNetwork20095317018310.1002/net.202761192.688212493697 – reference: McKee, S.A., Barrera, T., Griffith, J., Robins, G., Zhang, T.: Toward a Steiner engine: enhanced serial and parallel implementations of the iterated 1-Steiner MRST algorithm. In: Proceedings of the Third Great Lakes Symposium on VLSI-Design Automation of High Performance VLSI Systems, vol. 2442, pp. 90–94 (1993) – reference: Di Fatta, G., Presti, G.L., Presti, G.L., Re, G.L., Re, G.L.: A parallel genetic algorithm for the steiner problem in networks. In: Proceedings of the 15th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2003) vol. 2, pp. 569–573 (2003) – reference: DrummondLUchoaEGoncalvesASilvaJSantosMDecastroMA grid-enabled distributed branch-and-bound algorithm with application on the Steiner problem in graphsParallel Comput.200632962964210.1016/j.parco.2005.09.0062269534 – reference: ZhouHEfficient Steiner tree construction based on spanning graphsIEEE Trans. Comput. Aided Des. Integr. Circuits Syst.200423570471010.1109/TCAD.2004.826557 – reference: OliveiraCPardalosPA survey of combinatorial optimization problems in multicast routingComput. Oper. Res.20053281953198110.1016/j.cor.2003.12.0071068.90027 – reference: VerhoevenMGASeverensMEMParallel local searchJ. Heuristics19951436510.1007/BF024303650853.68156 – reference: Kahng, A., Robins, G.: A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach. In: IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, pp. 428–431 (1990) – reference: PrömelHJStegerAA new approximation algorithm for the Steiner tree problem with performance ratio 5/3J. Algorithms20003618910110.1006/jagm.2000.10860959.681011768992 – reference: Fobel, C., Grewal, G.: A parallel Steiner tree heuristic for macro cell routing. In: IEEE International Conference on Computer Design, vol. 27–33 (2008) – reference: Martins, S.L., Ribeiro, C.C., Souza, M.C.: A parallel GRASP for the Steiner problem in graphs. In: IRREGULAR ’98: Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, pp. 285–297 (1998) – reference: AroraSPolynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJACM199845575378210.1145/290179.2901801064.90566 – reference: ZelikovskyAAn 11/8-approximation algorithm for the Steiner problem on networks with rectilinear distanceColl. Math. Soc. Janos Bolyai1992607337451218233 – reference: Rugelj, J.: Distributed multicast routing mechanism for global point-to-point networks. In: Proceedings of Twentieth Euromicro Conference, System Architecture and Integration, pp. 389–395 (1994) – reference: HandaYOnoHSadakaneKYamashitaMNeighboorhood composition: a parallelization of local search algorithms2004BerlinSpringer – reference: Du, D.Z., Rubensteiner, J.H., Smith, J.M.: Advances in Steiner trees. In: Combinatorial Optimization, vol. 6. Kluwer Academic Publishers, Dordrecht (2000) – reference: Presti, G.L., Re, G.L., Storniolo, P., Urso, A.: A grid enabled parallel hybrid genetic algorithm for SPN. In: ICCS: Lecture Notes in Computer Science. Springer, pp. 156–163 (2004) – reference: KouLMarkowskyGBermanLA fast algorithm for Steiner treesActa Inf.1981154114510.1007/BF00288961599613 – reference: Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and, Applied Mathematics, pp. 770–779 (2000) – reference: IvanovAOTuzhilinAAGeometry of minimal networks and the one-dimensional Plateau problemRuss. Math. Surv.19924725913110.1070/RM1992v047n02ABEH0008781185285 – reference: Novak, R., Rugelj, J.: Distribution of constrained Steiner tree computation in shortest-delay networks. In: MELECON’96, 8th Mediterranean Electrotechnical Conference, vol. 2, pp. 0–3 (1996) – reference: WongRichardTA dual ascent approach for steiner tree problems on a directed graphMath. Program.198428327128710.1007/BF026123350532.90092 – reference: Huy, N.V., Nghia, N.D.: Solving graphical Steiner tree problem using parallel genetic algorithm. In: IEEE International Conference on Research, Innovation, pp. 29–35 (2008) – reference: Bastos, M.P., Ribeiro, C.C.: Reactive tabu search with path-relinking for the Steiner problem in graphs. In: Proceedings of the Third Metaheuristics International Conference, pp. 31–36 (1999) – reference: Akbari, H., Iranmanesh, Z., Ghodsi, M.: Parallel Minimum Spanning Tree Heuristic for the Steiner problem in graphs. In: 2007 International Conference on Parallel and Distributed Systems, pp. 1–8 (2007) – reference: KunZYongQHongZDynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problemKnowl Based Syst.200619755456410.1016/j.knosys.2006.04.012 – reference: GloverFFuture paths for integer programming and links to artificial intelligenceComput. Oper. Res.19861353354910.1016/0305-0548(86)90048-10615.90083868908 – reference: Singh, G., Vellanki, K.: A distributed protocol for constructing multicast trees. In: 2nd International Conference On Principles Of Distributed Systems (OPODIS’98), pp. 61–76 (1998) – reference: Coulston, C.S.: Constructing exact octagonal Steiner minimal trees. In: GLSVLSI ’03: Proceedings of the 13th ACM Great Lakes Symposium on VLSI, ACM, pp. 1–6 (2003) – reference: VoßSSteiner’s problem in graphs: heuristic methodsDiscret. Appl. Math.199240457210.1016/0166-218X(92)90021-20758.68032 – reference: EsbensenHComputing near-optimal solutions to the Steiner problem in a graph using a genetic algorithmNetworks19952617318510.1002/net.32302604030856.90115 – reference: Harris, Jr. F.C.: Parallel computation of steiner minimal trees. In: Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing, pp. 267–272 (2007) – reference: CormenTHLeisersonCERivestRLSteinCIntroduction to algorithms20012New YorkMcGraw-Hill Science/Engineering/Math1047.68161 – reference: KompellaVPPasqualeJCPolyzosGCTwo distributed algorithms for multicasting multimedia informationIEE/ACM Trans. Netw.1993128629210.1109/90.234851 – reference: KarpinskiMZelikovskyANew approximation algorithms for the Steiner tree problemJ. Comb. Optim.19971476510.1023/A:10097589197360895.901711606177 – reference: Du, D.Z., Zhang, Y., Feng, Q.: On better heuristic for Euclidean Steiner minimum trees. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. pp. 431–439 (1991) – reference: Simchi-LeviDBienstockDGoemansMXWilliamsonDA note on the prize collecting traveling salesman problemMath. Program.19935941342010.1007/BF015812560793.900891226826 – reference: NovakRA note on distributed multicast routing in point-to-point networksComput. Oper. Res.200128121149116410.1016/S0305-0548(00)00029-01017.900901848736 – reference: DowslandKAHill-climbing simulated annealing and the Steiner problem in graphsEng. Optim.1991179110710.1080/03052159108941063 – reference: DunlopAEKernighanBWA procedure for placement of standard-cell VLSI circuitsIEEE Trans. Comput. Aided Des. Integr. Circuits Syst.19854929810.1109/TCAD.1985.1270101 – reference: HollandJAdaptation in natural and artificial systems1975Ann Arbor, MIUniversity of Michigan Press – reference: Santos, M., Drummond, L.M.A., Uchoa, E.: Distributed Dual Ascent Algorithm for Steiner Problems in Networks. Anais do simpósio brasileiro de redes de computadores, pp. 381–394 (2007). http://www.sbrc2007.ufpa.br/Anais-SBRC2007.zip – reference: Lin, G.H., Jiang, T., Kearney, P.E.: Phylogenetic k-Root and Steiner k-Root. Lecture notes in computer science, pp. 539–551 (2000) – reference: DuinCWVoßSEfficient path and vertex exchange in Steiner tree algorithmsNetworks1995298910510.1002/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7 – reference: DuDZHwangFKA proof of Gilbert and Pollak’s conjecture on the Steiner ratioAlgorithmica199272/312113510.1007/BF017587550774.050271146492 – reference: ZachariasenMLocal search for the Steiner tree problem in the Euclidean planeEur. J. Oper. Res.1999119228230010.1016/S0377-2217(99)00131-90933.900651675217 – reference: KirkpatrickSGelattCDVecchiMPOptimization by simulated annealingScience198322067168010.1126/science.220.4598.6711225.90162702485 – reference: MartinsSLResendeMGCRibeiroCCPardalosPMA parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategyJ. Global Optim.200017126728310.1023/A:10265467087571044.900631807979 – reference: Hougardy, S., Prömel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: SODA ’99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and, Applied Mathematics, pp. 448–453 (1999) – reference: SmithWDSmithJMGOn the Steiner ratio in 3-spaceJ. Comb. Theory Ser. A199569230133210.1016/0097-3165(95)90055-10831.05021 – reference: Spoon, S.A.: A Parallel Branch-and-Bound Algorithm for Finding Steiner Minimal Trees (1996) – reference: PrömelHJStegerAThe Steiner tree problem2002GermanyFriedrick Vieweg and Son10.1007/978-3-322-80291-00992.68156 – reference: Gröpl, C., Hougardy, S., Nierhoff, T., Prömel, H.J.: Approximation algorithms for the Steiner tree problem in graphs. In: Combinatorial Optimization, vol. 11. Kluwer Academic Publishers, Dordrecht (2002) – reference: Muhmmad, R.B.: Parallelization of local search for Euclidean Steiner tree problem. In: Proceedings of the 44th Annual Southeast Regional Conference on - ACM-SE 44, pp. 233–238 (2006) – reference: KesselmanCFosterIThe grid: blueprint for a new computing infrastructure1998FloridaMorgan Kaufmann Publishers – reference: WinterPAn algorithm for the Steiner problem in Euclidean planeNetworks19851532334510.1002/net.32301503050586.90087801493 – reference: VaziraniVVApproximation algorithms2001BerlinSpringer – reference: Rao, S.B., Smith, W.D.: Approximating geometrical graphs via “spanners” and “banyans”. In: STOC ’98: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 540–550. ACM (1998) – reference: Zachariasen, M.: Algorithms for plane Steiner tree problems. Ph. d. University of Copenhagen (1998) – reference: PrimRCShortest connection networks and some generalizationsBell Syst. Technol. J.1957361389140110.1002/j.1538-7305.1957.tb01515.x – reference: HwangFKRichardsDSWinterPThe Steiner tree problem1992AmsterdamNorth Holland0774.05001 – reference: GilbertENPollakHOSteiner minimal treesSIAM J. Appl. Math.19661612910.1137/0116001223269 – reference: Lu, C.L., Tang, C.Y., Lee, R.C.T.: The full Steiner tree problem in phylogeny. In: COCOON ’02: Proceedings of the 8th Annual International Conference on Computing and Combinatorics, pp. 107–116. Springer, London (2002) – reference: Xu, J., Hong, Y., Jing, T., Yang, Y.: Obstacle-avoiding rectilinear minimum-delay Steiner tree construction towards IP-block-based SOC design. In: ISQED ’05: Proceedings of the 6th International Symposium on Quality of Electronic Design, pp. 616–621. IEEE Computer Society (2005) – reference: SmithWDHow to find Steiner minimal trees in Euclideand spaceAlgorithmica1992713717710.1007/BF017587560751.050281146493 – reference: ZelikovskyAAn 11/6-approximation algorithm for the network Steiner problemAlgorithmica1993946347010.1007/BF011870350768.681921212159 – reference: ZhaoJChenCAhmadiMProbability-based approach to rectilinear Steiner tree problemsIEEE Trans. VLSI Syst.20021083684310.1109/TVLSI.2002.808463 – reference: DuDHuXSteiner tree problem in computer communication networks2008SingaporeWorld Scientific10.1142/6729 – reference: BernMPlassmannPThe Steiner problem with edge lengths 1 and 2Inf. Process. Lett.19893217117610.1016/0020-0190(89)90039-20677.680741015826 – reference: Rayward-SmithVJThe computation of nearly minimal Steiner trees in graphsInternat. J. Math. Educ. Sci. Technol.198314152310.1080/00207398301401030512.05024696505 – reference: Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972) – ident: 243_CR5 doi: 10.1007/978-1-4613-0255-1_7 – volume: 30 start-page: 104 year: 1976 ident: 243_CR26 publication-title: SIAM J. Appl. Math. doi: 10.1137/0130013 – ident: 243_CR93 doi: 10.1109/ICCIT.2008.167 – volume: 6 start-page: 117 year: 1996 ident: 243_CR60 publication-title: Telecommun Syst doi: 10.1007/BF02114289 – volume: 59 start-page: 413 year: 1993 ident: 243_CR38 publication-title: Math. Program. doi: 10.1007/BF01581256 – volume: 7 start-page: 137 year: 1992 ident: 243_CR37 publication-title: Algorithmica doi: 10.1007/BF01758756 – ident: 243_CR79 – volume-title: The grid: blueprint for a new computing infrastructure year: 1998 ident: 243_CR85 – volume: 10 start-page: 836 year: 2002 ident: 243_CR118 publication-title: IEEE Trans. VLSI Syst. doi: 10.1109/TVLSI.2002.808463 – ident: 243_CR94 doi: 10.1109/ICCAD.1991.185271 – volume: 1 start-page: 286 year: 1993 ident: 243_CR70 publication-title: IEE/ACM Trans. Netw. doi: 10.1109/90.234851 – ident: 243_CR10 – ident: 243_CR122 doi: 10.1007/3-540-45655-4_13 – volume-title: Introduction to parallel algorithms and architectures: array, trees, hypercubes year: 1992 ident: 243_CR101 – volume: 17 start-page: 267 issue: 1 year: 2000 ident: 243_CR106 publication-title: J. Global Optim. doi: 10.1023/A:1026546708757 – volume: 96 start-page: 209 issue: 12 year: 2000 ident: 243_CR36 publication-title: Ann. Oper. Res. – ident: 243_CR41 doi: 10.1145/764809.764810 – volume: 1 start-page: 74 issue: 1 year: 2005 ident: 243_CR43 publication-title: ACM Trans. Algorithms doi: 10.1145/1077464.1077470 – ident: 243_CR13 – ident: 243_CR33 doi: 10.1007/978-1-4684-2001-2_9 – volume-title: Approximation algorithms year: 2001 ident: 243_CR30 – volume: 17 start-page: 91 year: 1991 ident: 243_CR62 publication-title: Eng. Optim. doi: 10.1080/03052159108941063 – ident: 243_CR96 doi: 10.1109/GLSV.1993.224473 – volume: 16 start-page: 1 year: 1966 ident: 243_CR7 publication-title: SIAM J. Appl. Math. doi: 10.1137/0116001 – ident: 243_CR27 – ident: 243_CR76 – volume: 69 start-page: 301 issue: 2 year: 1995 ident: 243_CR25 publication-title: J. Comb. Theory Ser. A doi: 10.1016/0097-3165(95)90055-1 – volume: 7 start-page: 219 year: 1992 ident: 243_CR91 publication-title: Algorithmica doi: 10.1007/BF01758759 – volume: 32 start-page: 777 issue: 11–12 year: 2006 ident: 243_CR75 publication-title: Parallel Comput. doi: 10.1016/j.parco.2006.09.002 – ident: 243_CR40 doi: 10.1109/ICPADS.2007.4447726 – volume: 27 start-page: 2083 issue: 11 year: 2008 ident: 243_CR89 publication-title: Comput. Aided Des. – volume: 41 start-page: 1069 year: 1990 ident: 243_CR117 publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1990.166 – volume-title: Computers and Intractability. A Guide to the Theory of NP-Completeness year: 1990 ident: 243_CR46 – ident: 243_CR9 – volume: 40 start-page: 45 year: 1992 ident: 243_CR100 publication-title: Discret. Appl. Math. doi: 10.1016/0166-218X(92)90021-2 – ident: 243_CR3 – ident: 243_CR39 – volume: 14 start-page: 15 year: 1983 ident: 243_CR54 publication-title: Internat. J. Math. Educ. Sci. Technol. doi: 10.1080/0020739830140103 – ident: 243_CR107 – volume: 11 start-page: 5745 issue: 8 year: 2011 ident: 243_CR114 publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.03.005 – ident: 243_CR42 doi: 10.1007/3-540-44679-6_57 – ident: 243_CR108 doi: 10.1007/978-3-540-24685-5_20 – volume: 53 start-page: 170 year: 2009 ident: 243_CR80 publication-title: Network doi: 10.1002/net.20276 – ident: 243_CR113 doi: 10.1109/RIVF.2008.4586329 – volume: 15 start-page: 323 year: 1985 ident: 243_CR90 publication-title: Networks doi: 10.1002/net.3230150305 – volume: 36 start-page: 1389 year: 1957 ident: 243_CR21 publication-title: Bell Syst. Technol. J. doi: 10.1002/j.1538-7305.1957.tb01515.x – volume: 28 start-page: 1149 issue: 12 year: 2001 ident: 243_CR74 publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(00)00029-0 – ident: 243_CR31 – volume-title: The handbook of ad hoc wireless networks year: 2003 ident: 243_CR120 – volume: 26 start-page: 173 year: 1993 ident: 243_CR57 publication-title: J. Oper. Res. Soc. – volume: 37 start-page: 66 year: 2000 ident: 243_CR45 publication-title: J. Algorithms doi: 10.1006/jagm.2000.1096 – volume: 3 start-page: 1 issue: 1 year: 2008 ident: 243_CR81 publication-title: ACM Trans. Auton. Adapt. Syst. doi: 10.1145/1342171.1342174 – volume: 5 start-page: 1 issue: 3 year: 2007 ident: 243_CR50 publication-title: ACM Trans. Algorithms doi: 10.1145/1541885.1541892 – volume: 1 start-page: 47 year: 1997 ident: 243_CR12 publication-title: J. Comb. Optim. doi: 10.1023/A:1009758919736 – ident: 243_CR88 doi: 10.1109/ICCAD.1990.129944 – volume: 36 start-page: 138 year: 2000 ident: 243_CR105 publication-title: Networks doi: 10.1002/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U – ident: 243_CR104 – volume-title: Mathematical Aspects of Network Routing Optimization year: 2011 ident: 243_CR69 doi: 10.1007/978-1-4614-0311-1 – volume: 74 start-page: 115 year: 1996 ident: 243_CR23 publication-title: J. Comb. Theory Ser. A doi: 10.1006/jcta.1996.0040 – volume: 47 start-page: 59 issue: 2 year: 1992 ident: 243_CR35 publication-title: Russ. Math. Surv. doi: 10.1070/RM1992v047n02ABEH000878 – ident: 243_CR72 doi: 10.1109/MELCON.1996.551368 – ident: 243_CR115 – ident: 243_CR123 doi: 10.1007/978-1-4613-0255-1_6 – volume: 32 start-page: 171 year: 1989 ident: 243_CR47 publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(89)90039-2 – volume: 1 start-page: 43 year: 1995 ident: 243_CR99 publication-title: J. Heuristics doi: 10.1007/BF02430365 – volume: 60 start-page: 733 year: 1992 ident: 243_CR17 publication-title: Coll. Math. Soc. Janos Bolyai – volume: 15 start-page: 41 year: 1981 ident: 243_CR55 publication-title: Acta Inf. – ident: 243_CR98 doi: 10.1145/331697.331752 – ident: 243_CR109 doi: 10.1145/1185448.1185500 – volume-title: Exact algorithms for plane Steiner tree problems: a computational study year: 2000 ident: 243_CR6 doi: 10.1007/978-1-4757-3171-2_6 – volume: 119 start-page: 282 issue: 2 year: 1999 ident: 243_CR110 publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(99)00131-9 – volume: 1 start-page: 195 year: 1972 ident: 243_CR4 publication-title: Networks doi: 10.1002/net.3230010302 – volume: 5 start-page: 66 year: 1983 ident: 243_CR71 publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/357195.357200 – volume-title: The Steiner tree problem year: 1992 ident: 243_CR32 – volume-title: Combinatorial optimization: algorithms and complexity year: 1998 ident: 243_CR48 – ident: 243_CR28 – volume: 29 start-page: 89 year: 1995 ident: 243_CR58 publication-title: Networks doi: 10.1002/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7 – volume-title: Steiner tree based distributed multicast routing in networks year: 2000 ident: 243_CR67 – ident: 243_CR102 doi: 10.1109/ICCD.2008.4751836 – volume: 26 start-page: 173 year: 1995 ident: 243_CR56 publication-title: Networks doi: 10.1002/net.3230260403 – volume: 295 start-page: 387 year: 2003 ident: 243_CR14 publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(02)00414-0 – ident: 243_CR73 doi: 10.1109/EURMIC.1994.390419 – volume: 32 start-page: 629 issue: 9 year: 2006 ident: 243_CR84 publication-title: Parallel Comput. doi: 10.1016/j.parco.2005.09.006 – volume: 30 start-page: 195 year: 1998 ident: 243_CR29 publication-title: J. Comb. Math. Combin. Comput. – ident: 243_CR61 – ident: 243_CR1 doi: 10.1007/978-1-4757-3171-2 – ident: 243_CR92 – volume: 32 start-page: 1953 issue: 8 year: 2005 ident: 243_CR68 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2003.12.007 – volume: 7 start-page: 48 year: 1956 ident: 243_CR20 publication-title: Proc. Am. Math. Soc. doi: 10.1090/S0002-9939-1956-0078686-7 – ident: 243_CR86 – volume: 220 start-page: 671 year: 1983 ident: 243_CR65 publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 4 start-page: 181 issue: 2 year: 1996 ident: 243_CR53 publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/90.490746 – ident: 243_CR103 – volume: 45 start-page: 753 issue: 5 year: 1998 ident: 243_CR34 publication-title: JACM doi: 10.1145/290179.290180 – volume: 100 start-page: 137 issue: 1–2 year: 2000 ident: 243_CR44 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(99)00200-0 – volume-title: Introduction to algorithms year: 2001 ident: 243_CR51 – ident: 243_CR97 – volume: 28 start-page: 271 issue: 3 year: 1984 ident: 243_CR78 publication-title: Math. Program. doi: 10.1007/BF02612335 – ident: 243_CR116 – volume: 9 start-page: 463 year: 1993 ident: 243_CR8 publication-title: Algorithmica doi: 10.1007/BF01187035 – volume-title: Steiner tree problem in computer communication networks year: 2008 ident: 243_CR15 doi: 10.1142/6729 – volume: 20 start-page: 374 issue: 4 year: 1998 ident: 243_CR83 publication-title: Algorithmica doi: 10.1007/PL00009201 – volume-title: The Steiner tree problem year: 2002 ident: 243_CR2 doi: 10.1007/978-3-322-80291-0 – volume: 19 start-page: 554 issue: 7 year: 2006 ident: 243_CR77 publication-title: Knowl Based Syst. doi: 10.1016/j.knosys.2006.04.012 – volume: 4 start-page: 92 year: 1985 ident: 243_CR95 publication-title: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. doi: 10.1109/TCAD.1985.1270101 – volume: 7 start-page: 121 issue: 2/3 year: 1992 ident: 243_CR22 publication-title: Algorithmica – volume-title: Neighboorhood composition: a parallelization of local search algorithms year: 2004 ident: 243_CR111 – ident: 243_CR121 doi: 10.1007/3-540-40996-3_46 – volume: 23 start-page: 704 issue: 5 year: 2004 ident: 243_CR87 publication-title: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. doi: 10.1109/TCAD.2004.826557 – volume-title: Adaptation in natural and artificial systems year: 1975 ident: 243_CR63 – volume: 60 start-page: 145 issue: 2 year: 2010 ident: 243_CR82 publication-title: Wirel. Pers. Commun. doi: 10.1007/s11277-010-9936-4 – volume: 24 start-page: 573 year: 1982 ident: 243_CR52 publication-title: Math. Jpn. – volume: 1 start-page: 69 year: 1996 ident: 243_CR59 publication-title: J. Comb. Optim. – ident: 243_CR18 doi: 10.1007/BFb0018547 – volume: 36 start-page: 89 issue: 1 year: 2000 ident: 243_CR11 publication-title: J. Algorithms doi: 10.1006/jagm.2000.1086 – ident: 243_CR16 doi: 10.1109/SFCS.1991.185402 – volume-title: Parallel metaheuristics for combinatorial optimization year: 1999 ident: 243_CR19 – volume: 13 start-page: 533 year: 1986 ident: 243_CR64 publication-title: Comput. Oper. Res. doi: 10.1016/0305-0548(86)90048-1 – volume: 21 start-page: 1087 year: 1953 ident: 243_CR66 publication-title: J. Chem. Phys. doi: 10.1063/1.1699114 – ident: 243_CR49 doi: 10.1145/276698.276868 – ident: 243_CR24 doi: 10.1007/s00453-008-9254-3 – ident: 243_CR119 – ident: 243_CR112 doi: 10.1109/MWSCAS.2008.4616743
SSID	ssj0009788
Score	2.0247498
Snippet	Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree that connects the input points, where it is possible to add new... Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree that connects the input points, where it is possible to add new...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	287
SubjectTerms	Algorithms Approximation Biology Computation Computer networks Computer Science Distributed processing Graphs Heuristic Multicast Optimization Parallel processing Processor Architectures Ratios Routing (telecommunications) Software Engineering/Programming and Operating Systems Studies Theory of Computation Trees Wire
SummonAdditionalLinks	– databaseName: Computer Science Database (ProQuest) dbid: K7- link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA46ffDFecXplAg-KcVe0qR5kqEOwTEGm7K3kqWJCrOb3QXcr_ekSzcV3IvPTZPQL-fkOznp-RC6EFxTL2KBwwiFAEVS3-GESyfytC8ZTF3kckDPDdZsRt0ub9kDt5G9Vln4xNxRJwNpzsivgbi4HPh35N0MPxyjGmWyq1ZCYx1teL7vmXX-yJxl0V2W606CIYUwlzAqsprzX-cYNbG0yWKSwJn93JeWZPNXfjTfdurl_054B21bwolr8xWyi9ZUuofKhZgDtra9jxo13J5kU_WJBxq3RGY0VvpYpAm-M7V1jSyWSnCt_wJjjF_fRxjYLgb2iNtGLxN66mRK4dZcn-YAPdXvO7cPjpVacGRA-BicsQhdAdyIaeEJAaQH4kpBVCCSnvZ8SSUF4NxQcipYAqSNESKYVopGiZYkDA5RKR2k6ghhIEg6kaYSWk-TQAtBIQDXIdg6OBNOZQW5xYeOpa1DbuQw-vGygrLBJgZsYoNNPKugy8Urw3kRjlWNqwUesbXHUbwEo4LOF4_Bkkx6RKRqMDFtfJcDfaPQ5qpA_VsXfw14vHrAE7QFJMve9qmi0jibqFO0Kafjt1F2li_YL9ze70s priority: 102 providerName: ProQuest
Title	A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
URI	https://link.springer.com/article/10.1007/s10766-013-0243-z https://www.proquest.com/docview/1500908681 https://www.proquest.com/docview/1520989361
Volume	42
WOSCitedRecordID	wos000331974200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: 7WY dateStart: 19970201 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: M0C dateStart: 19970201 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: P5Z dateStart: 19970201 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database (ProQuest) customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: K7- dateStart: 19970201 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: BENPR dateStart: 19970201 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library (Proquest) customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: M2O dateStart: 19970201 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-7640 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZS8QwEB68HnzxFtdjieCTUuiRJs3jeiGoa3G9X0pMExXWrnR3Bf31Trqtq6KCvgRKp-kwySTfMMl8ABtSGOZFPHA4ZRigKOY7ggrlRJ7xFUfVZUEHdHHEm83o6krE5T3ubnXavUpJFiv1h8tunNno1-YdaeC8jsI47naR9cbT1sWw0i4vyCbRe0JUIIyqVOZ3XXzejIYI80tStNhr9qf_peUMTJXQkjQGc2EWRnQ2B9MVbQMpvXgejhqk1c-f9QvpGBLL3LKptInMUrJrq-haAiydkkb7rpM_9O4fuwRxLUGcSFqWGRN7Osu1JvGAiWYBzvf3znYOnJJUwVEBFT1cdmXoSkRB3EhPSoQ3GEFKqgOZ3hrPV0wxHCI3VIJJniI845RKbrRmUWoUDYNFGMs6mV4CglDIpMrWPLs1NDBSMgy1TYhejcuGYKoGbmXdRJUVxy3xRTsZ1kq21krQWom1VvJag833T54G5TZ-E16thiwpPa-bIMB1BcZpkVeD9ffX6DM2ESIz3elbGR8njggYymxVw_ihi59-uPwn6RWYRHRVHvNZhbFe3tdrMKGeew_dvA6j_PK6DuPbe834FJ8OuYPtsbtjW_8E2zi8qRdT-w1xmewL
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4hQGovpdBWLFBwpfbSKmoejh0fEFrxEIhltRLbiltqHBsqLVnI7oLgR_EbmcmDLZXKjUPPcfzIjD9_ztjzAXzWyokgkZEnucANihGhp7gyXhK40Ejsui7lgH52ZLebnJyo3gzcN3dh6Fhlg4klUGdDQ__IvyNx8RXy7yTYurzySDWKoquNhEblFof29ga3bKPNgx2075cw3Nvtb-97taqAZyKuxog7OvY10gDpdKA1ru-4hdLcRjo7dUFohBHYRz82SmiZIT-RnGvprBVJ5gwnlQiE_DnOcTrQUUF_e5rkV5Y6lzhxYxx7nDRR1OqqnhS0d6eoKY-8u6fr4JTc_hWPLZe5vYX_7QO9hTc1oWbtagYswozNl2ChEatgNXa9g06bHU-Ka3vLho71dEEaMgOm84ztUO5gkv2yGWsPznBM4_OLEUM2z5Ads2PSA8Wa-oW1rFfp77yHHy8ypg8wmw9zuwwMCaDLDGV6O3U8cloLoXwXI5YhWCphWuA3hk1NnWed5D4G6TRDNPlCir6Qki-kdy34-vjKZZVk5LnCa4390xpvRunU-C349PgYkYLCPzq3wwmVCX2F9FRgmW-Nl_1Rxb8aXHm-wQ14td8_6qSdg-7hKrxGQlmfbFqD2XExsR9h3lyPf4-K9XKyMPj10s73AHJSTPA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1dT9swFL1CbEK8jG2A6GCbkcYLKCIfjh0_TFO1rgK1qirxId6CcextUpdC2jLBT9uv2735oGMSvPHAc5zYSc49Ps517gH4pJUTQSIjT3KBCxQjQk9xZbwkcKGROHRd2gGd9uVgkJydqeEC_Gn-haFtlQ0nlkSdjQ19I99H4eIr1N9JsO_qbRHDTvfL5ZVHDlKUaW3sNCqI9OzNb1y-TT4fdvBd74Rh99vx1wOvdhjwTMTVFDlIx75GSSCdDrTGuR6XU5rbSGcXLgiNMALH68dGCS0z1CqScy2dtSLJnOHkGIH0_wJn4ZhirCe9ecFfWXpeYhDH-BzipMmoVr_tSUHreMqg8si7vT8nzoXuf7nZcsrrrjznh_UaXtVCm7WryHgDCzZ_CyuNiQWrOW0V-m12NCuu7Q0bOzbUBXnLjJjOM9ahmsJkB2Yz1h59x3ua_vg1YajyGapmdkQ-oXil48JaNqx8edbg5EnuaR0W83FuN4ChMHSZoQpwF45HTmshlO9i5DgkUSVMC_zmJaemrr9ONiCjdF45mnCRIi5SwkV624Ldu1Muq-IjjzXearCQ1jw0SedAaMH23WFkEEoL6dyOZ9Qm9BXKVoFt9hrE_XOJhzp893iHH2EJMZf2Dwe9TVhGnVlveNqCxWkxs-_hpbme_pwUH8q4YXD-1Nj7CxeTVZY
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Survey+of+Parallel+and+Distributed+Algorithms+for+the+Steiner+Tree+Problem&rft.jtitle=International+journal+of+parallel+programming&rft.au=Bezensek%2C+Mitja&rft.au=Robic%2C+Borut&rft.date=2014-04-01&rft.issn=0885-7458&rft.eissn=1573-7640&rft.volume=42&rft.issue=2&rft.spage=287&rft.epage=319&rft_id=info:doi/10.1007%2Fs10766-013-0243-z&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0885-7458&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0885-7458&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0885-7458&client=summon