"A better approximation algorithm for the budget prize collecting tree problem."

Asaf Levin (2004)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2003.11.002

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Levin04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Levin04
Asaf Levin:
A better approximation algorithm for the budget prize collecting tree problem. Oper. Res. Lett. 32(4): 316-319 (2004)

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.