"On Steiner trees and minimum spanning trees in hypergraphs."

Tobias Polzin, Siavash Vahdati Daneshmand (2003)

> Home

Details and statistics

DOI: 10.1016/S0167-6377(02)00185-2

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/PolzinD03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/PolzinD03
Tobias Polzin, Siavash Vahdati Daneshmand:
On Steiner trees and minimum spanning trees in hypergraphs. Oper. Res. Lett. 31(1): 12-20 (2003)

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.