Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

Daniel Rehfeldt, Thorsten Koch. Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem. SIAM Journal on Optimization, 29(1):369-398, 2019. [doi]

Authors

Daniel Rehfeldt

This author has not been identified. Look up 'Daniel Rehfeldt' in Google

Thorsten Koch

This author has not been identified. Look up 'Thorsten Koch' in Google