Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
From MaRDI portal
Publication:3882476
DOI10.1007/BFb0120910zbMath0441.05017OpenAlexW173428383MaRDI QIDQ3882476
Lone Aalekjaer Hansen, Jens Clausen
Publication date: 1980
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120910
Hamiltonian circuittravelling salesman problemmatroidminimum spanning treeGreedy algorithmperipatetic salesman problemminimum weight base
Trees (05C05) Deterministic network models in operations research (90B10) Combinatorial aspects of finite geometries (05B25) Directed graphs (digraphs), tournaments (05C20)
Related Items
Sensitivity analysis for symmetric 2-peripatetic salesman problems, Obtaining approximately optimal and diverse solutions via dispersion, Edge-disjoint spanning trees and the number of maximum state circles of a graph, The partial sum criterion for Steiner trees in graphs and shortest paths