A Steiner graph solver using: binary heap, adjacency list, Dijkstra’s algorithm, OpenMP parallelisation, Takahashi and Matsuyama's heuristics, with tools for solution verification and validation
-
Updated
Mar 19, 2024 - C++
A Steiner graph solver using: binary heap, adjacency list, Dijkstra’s algorithm, OpenMP parallelisation, Takahashi and Matsuyama's heuristics, with tools for solution verification and validation
This is a code base for various algorithms implemented for the PACE 2018 Challenge.
A Genetic Algorithm for the Steiner Tree Problem (C++)
A program to solve the ST problem using The Prim algorithm.
ENERGY EFFICIENT REGENERATION AWARE ROUTING MODULATION AND SPECTRUM ALLOCATION FOR MULTICAST SESSION IN ELASTIC OPTICAL NETWORK
Genetic Algorithms (Canonical and CHC) solving the Generalised Steiner Problem
Steiner Tree Problem (STP) KMB algorithm implementation in C++ and Python. Used OpenMP for faster calculation.
Dijkstra-Steiner Algorithm with future costs
Sorbonne Université MU4IN505
Add a description, image, and links to the steiner-tree-problem topic page so that developers can more easily learn about it.
To associate your repository with the steiner-tree-problem topic, visit your repo's landing page and select "manage topics."