"Reduction techniques for the prize collecting Steiner tree problem and the ..."

Daniel Rehfeldt, Thorsten Koch, Stephen J. Maher (2019)

> Home

Details and statistics

DOI: 10.1002/NET.21857

access: closed

type: Journal Article

metadata version: 2019-02-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/RehfeldtKM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/RehfeldtKM19
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.