The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices
type: Item
instance of: scholarly article
title: The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices
zbMATH Open document ID: 0939.68091
DOI: 10.1016/S0898-1221(98)00150-3
author: Bettina Klinz
author: Tibor Dudás
author: Gerhard J. Woeginger
publication date: 1999-11-08T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1358067
zbMATH Keywords: undirected graph
MaRDI profile type: Publication
cites work: Weighted k‐cardinality trees: Complexity and polyhedral structure
cites work: The minimum latency problem
cites work: Q4234074
cites work: Spanning Trees—Short or Small
cites work: Q4274209
cites work: Q3768703
cites work: The computational complexity of Steiner tree problems in graded matrices
cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
full work available at URL: s0898-1221(98)00150-3
OpenAlex ID: W1995291660
Recommended article: The computational complexity of Steiner tree problems in graded matrices
Recommended article: The complexity of minimum ratio spanning tree problems
Recommended article: Q5309465
Recommended article: Q5743495
Recommended article: An algorithm for \(k^{\text{th}}\) minimum spanning tree
Recommended article: The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
Recommended article: On the complexity of the bilevel minimum spanning tree problem
Recommended article: Approximating \(k\)-hop minimum-spanning trees
Recommended article: Minimum spanning trees in \(d\) dimensions
Recommended article: Q4948733
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1358067