Very fast, exact Steiner tree solver

Graph-based Deterministic Policy Gradient for Repetitive Combinatorial Optimization Problems

R Package: Steiner tree approach for graph analysis

Python parser for the SteinLib Testdata Library

Two algorithms in Java for building Steiner trees: one that accepts a list of unconnected points in the Euclidean plane and efficiently connects them with a tree, and one that accepts an undirected graph with weighted edges and a list of some of the graph's vertices, that it may efficiently connect those vertices with a tree-shaped subgraph.

Multi-level Node weighted Steiner trees - implementation of heuristics to compute them

Code for " Discovering topically- and temporally-coherent events in interaction networks" ECML PKDD 2016

Dijkstra-Steiner Algorithm with future costs

Integrating 'omics data with biological networks by solving Steiner Tree problems

An algorithm to find Steiner Trees in a undirected graph using an heuristic function for computing paths

R Package: Convenient tool for solving the Prize-Collecting Steiner Tree problem

A Genetic Algorithm for the Steiner Tree Problem (C++)

Code for "Reconstructing a cascade from temporal observations, SDM 2018"

Solving Steiner Tree Problem in Graphs (STPG) with a Genetic Algorithm.

A java implemetation of a heuristic algorithm for steiner minimum tree.

Genetic Algorithms (Canonical and CHC) solving the Generalised Steiner Problem

Solves the connected subgraph problem.

Trabalho de conclusão do curso de Engenharia de Computação da Universidade Tecnológica Federal do Paraná - CP

GPU Steiner is an improved version of a well known KMB algorithm, a two approximation algorithm. We have two implementations seqCPU and parallel GPU version.

Rajesh's tools