pcst-fast
A fast implementation of the Goemans-Williamson scheme for the PCST (prize-collecting Steiner tree/forest) problem.
A fast implementation of the Goemans-Williamson scheme for the PCST (prize-collecting Steiner tree/forest) problem.
To install this package, run one of the following:
Summary
A fast implementation of the Goemans-Williamson scheme for the PCST (prize-collecting Steiner tree/forest) problem.
Last Updated
Oct 8, 2024 at 15:26
License
MIT
Total Downloads
1.1K
Supported Platforms