English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

On Steiner trees and minimum spanning trees in hypergraphs

MPS-Authors
/persons/resource/persons45206

Polzin,  Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Polzin, T., & Vahdati Daneshmand, S. (2003). On Steiner trees and minimum spanning trees in hypergraphs. Operations Research Letters, 31, 12-20.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2D9E-8
Abstract
There is no abstract available