Packing Spanning Trees

DOI10.1287/moor.20.1.104zbMath0835.90110OpenAlexW2123720352MaRDI QIDQ4835388

Francisco Barahona

Publication date: 14 June 1995

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.20.1.104

zbMATH Keywords

maximum flow computationspacking spanning trees in a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

A linear programming approach to increasing the weight of all minimum spanning trees ⋮ Faster algorithms for security games on matroids ⋮ Independent spanning trees on even networks ⋮ Eisenberg-Gale markets: algorithms and game-theoretic properties ⋮ Non-preemptive tree packing ⋮ Network strength games: the core and the nucleolus ⋮ Non-preemptive tree packing ⋮ On packing connectors ⋮ Random sampling and greedy sparsification for matroid optimization problems

This page was built for publication: Packing Spanning Trees