"A 5-approximation algorithm for the k-prize-collecting Steiner tree problem."

Lu Han et al. (2019)

> Home

Details and statistics

DOI: 10.1007/S11590-017-1135-8

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/HanXDW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/HanXDW19
Lu Han, Dachuan Xu, Donglei Du, Chenchen Wu:
A 5-approximation algorithm for the k-prize-collecting Steiner tree problem. Optim. Lett. 13(3): 573-585 (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.