A fast implementation of the Goemans-Williamson scheme for the prize-collecting Steiner tree / forest problem.
-
Updated
Oct 17, 2024 - C++
A fast implementation of the Goemans-Williamson scheme for the prize-collecting Steiner tree / forest problem.
Add a description, image, and links to the pcst topic page so that developers can more easily learn about it.
To associate your repository with the pcst topic, visit your repo's landing page and select "manage topics."