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.
Repository for the paper "Fast and Provable Greedy Algorithms for the Max-Cut Relaxation"
Add a description, image, and links to the goemans-williamson topic page so that developers can more easily learn about it.
To associate your repository with the goemans-williamson topic, visit your repo's landing page and select "manage topics."