The computational complexity of Steiner tree problems in graded matrices

Bettina Klinz, Gerhard Johannes Wöginger, Tibor Dudas

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	35-39
Journal	Applied Mathematics Letters
Volume	10
Issue number	4
DOIs	https://doi.org/10.1016/S0893-9659(97)00056-6
Publication status	Published - 1997

Access to Document

@article{8f75a7aba5a6476b8d9e0a4610b85e38,

title = "The computational complexity of Steiner tree problems in graded matrices",

author = "Bettina Klinz and W{\"o}ginger, {Gerhard Johannes} and Tibor Dudas",

year = "1997",

doi = "10.1016/S0893-9659(97)00056-6",

language = "English",

volume = "10",

pages = "35--39",

journal = "Applied Mathematics Letters",

issn = "1873-5452",

publisher = "Elsevier Limited",

number = "4",

}

TY - JOUR

T1 - The computational complexity of Steiner tree problems in graded matrices

AU - Klinz, Bettina

AU - Wöginger, Gerhard Johannes

AU - Dudas, Tibor

PY - 1997

Y1 - 1997

U2 - 10.1016/S0893-9659(97)00056-6

DO - 10.1016/S0893-9659(97)00056-6

M3 - Article

SN - 1873-5452

VL - 10

SP - 35

EP - 39

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 4

ER -