Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory (Q3882476)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3687399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory |
scientific article; zbMATH DE number 3687399 |
Statements
Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory (English)
0 references
1980
0 references
travelling salesman problem
0 references
peripatetic salesman problem
0 references
minimum weight base
0 references
matroid
0 references
Greedy algorithm
0 references
Hamiltonian circuit
0 references
minimum spanning tree
0 references
