The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices
From MaRDI portal
Publication:1806599
DOI10.1016/S0898-1221(98)00150-3zbMath0939.68091OpenAlexW1995291660MaRDI QIDQ1806599
Bettina Klinz, Tibor Dudás, Gerhard J. Woeginger
Publication date: 8 November 1999
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00150-3
Related Items (3)
The quadratic minimum spanning tree problem and its variations ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Local search algorithms for the \(k\)-cardinality tree problem.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computational complexity of Steiner tree problems in graded matrices
- The minimum latency problem
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- Spanning Trees—Short or Small
This page was built for publication: The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices
