"Efficient Algorithms for the Prize Collecting Steiner Tree Problems with ..."

Eduardo Álvarez-Miranda et al. (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-14355-7_3

access: closed

type: Conference or Workshop Paper

metadata version: 2021-02-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aaim/Alvarez-MirandaCCHL10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaim/Alvarez-MirandaCCHL10
Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xujin Chen, Xiaodong Hu, Bi Li:
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. AAIM 2010: 13-24

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.