Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory (Q3882476): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bfb0120910 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W173428383 / rank | |||
Normal rank | |||
Latest revision as of 10:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory |
scientific article |
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
