A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks
The Prize-collecting Steiner Forest (PCSF) problem is NP-hard, requiring extreme computational effort to find exact solutions for large inputs. We introduce a new heuristic algorithm for PCSF which preserves the quality of solutions obtained by previous heuristic approaches while reducing the runtim...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer International Publishing,
2018-10-09T13:46:44Z.
|
| Subjects: | |
| Online Access: | Get fulltext |