On Steiner trees and minimum spanning trees in hypergraphs

Local TagsRelease HistoryDetailsSummary

On Steiner trees and minimum spanning trees in hypergraphs

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

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2D9E-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2D9F-6

Genre: Journal Article

show

show

hide

Creators:
Polzin, Tobias¹, Author
Vahdati Daneshmand, Siavash, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Modified: 2004-06-17Date issued: 2003

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 201938
Other: Local-ID: C1256428004B93B8-E49C6DE8DB1346A6C1256C72004783C9-Polzin2002-MSTH

Degree: -

show

show

show

show

hide

Title: Operations Research Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 31 Sequence Number: - Start / End Page: 12 - 20 Identifier: ISSN: 0167-6377