Rights statement: This is the peer reviewed version of the following article: Rehfeldt D, Koch T, Maher SJ. Reduction techniques for the prize collecting Steiner tree problem and the maximum‐weight connected subgraph problem. Networks. 2018;1–28. https://doi.org/10.1002/net.21857 which has been published in final form at https://onlinelibrary.wiley.com/doi/10.1002/net.21857 This article may be used for non-commercial purposes in accordance With Wiley Terms and Conditions for self-archiving.
Accepted author manuscript, 566 KB, PDF document
Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
<mark>Journal publication date</mark> | 03/2019 |
---|---|
<mark>Journal</mark> | Networks |
Issue number | 2 |
Volume | 73 |
Number of pages | 28 |
Pages (from-to) | 206-233 |
Publication Status | Published |
Early online date | 26/10/18 |
<mark>Original language</mark> | English |