Daniel Rehfeldt, Thorsten Koch, Stephen J. Maher. Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. Networks, 73(2):206-233, 2019. [doi]
@article{RehfeldtKM19,
title = {Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem},
author = {Daniel Rehfeldt and Thorsten Koch and Stephen J. Maher},
year = {2019},
doi = {10.1002/net.21857},
url = {https://doi.org/10.1002/net.21857},
researchr = {https://researchr.org/publication/RehfeldtKM19},
cites = {0},
citedby = {0},
journal = {Networks},
volume = {73},
number = {2},
pages = {206-233},
}