Editing Steiner tree problem (section)

==External links==
{{Commons category|Steiner tree problem}}
*[http://www.geosteiner.com/ GeoSteiner] (Software for solving Euclidean and rectilinear Steiner tree problems; source available, free for non-commercial use)
*[https://scipjack.zib.de/ SCIP-Jack] (Software for solving the Steiner tree problem in graphs and 14 variants, e.g., prize-collecting Steiner tree problem; free for non-commercial use)
*[http://nuclear.llnl.gov/CNP/apt/apt/aptsver.html Fortran subroutine] for finding the Steiner vertex of a triangle (i.e., [[Fermat point]]), its distances from the triangle vertices, and the relative vertex weights.
*[http://phylomurka.sf.net Phylomurka] (Solver for small-scale Steiner tree problems in graphs)
*[https://www.youtube.com/watch?v=PI6rAOWu-Og https://www.youtube.com/watch?v=PI6rAOWu-Og] (Movie: solving the Steiner tree problem with water and soap)
* {{Citation | url = https://www.researchgate.net/publication/316921061 | title = DCCast: Efficient Point to Multipoint Transfers Across Datacenters | contribution = Using Steiner Trees to Minimize Average Completion Times of Bulk Data Transfers | publisher = USENIX Association| last1 = Noormohammadpour | first1 = Mohammad | last2 = Raghavendra | first2 = Cauligi S. | last3 = Rao | first3 = Sriram | last4 = Kandula | first4 = Srikanth | year = 2017 | arxiv = 1707.02096 }}
*{{springer|title=Steiner tree problem|id=s/s110270|last=Hazewinkel|first=M.}}
*[http://theory.cs.uni-bonn.de/info5/steinerkompendium/ M. Hauptmann, M. Karpinski (2013): A Compendium on Steiner Tree Problems] 

[[Category:NP-complete problems]]
[[Category:Trees (graph theory)]]
[[Category:Computational problems in graph theory]]
[[Category:Geometric algorithms]]
[[Category:Geometric graphs]]