The computational complexity of Steiner tree problems in graded matrices

DOI10.1016/S0893-9659(97)00056-6zbMath0891.05019MaRDI QIDQ1372300

Tibor Dudás, Gerhard J. Woeginger, Bettina Klinz

Publication date: 9 December 1997

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitySteiner tree problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The quadratic minimum spanning tree problem and its variations ⋮ The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices ⋮ K-center and K-median problems in graded distances

Cites Work

• The Steiner tree problem
• The Complexity of Computing Steiner Minimal Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item