Packing Spanning Trees

DOI10.1287/MOOR.20.1.104MaRDI QIDQ4835388zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Integral packing of trees and branchings
• Tree packing and approximating k-cuts
• On the tree packing problem

Cited in

(19)

• On packing connectors
• Random sampling and greedy sparsification for matroid optimization problems
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• An algorithm for packing connectors
• Packing in trees
• Integral packing of trees and branchings
• Network strength games: the core and the nucleolus
• A note on packing spanning trees in graphs and bases in matroids
• Spanning distribution forests of graphs (extended abstract)
• A linear programming approach to increasing the weight of all minimum spanning trees
• scientific article; zbMATH DE number 3908451 (Why is no real title available?)
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Independent spanning trees on even networks
• Non-preemptive tree packing
• Non-preemptive tree packing
• Packing trees
• Faster algorithms for security games on matroids
• An algorithm for packing hypertrees
• Eisenberg-Gale markets: algorithms and game-theoretic properties

This page was built for publication: Packing Spanning Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835388)