Finding minimum congestion spanning trees

DOI10.1145/351827.384253zbMath1066.05050OpenAlexW2120414727MaRDI QIDQ5463408

João C. Setubal, Renato F. Werneck

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/351827.384253

zbMATH Keywords

polynomial time algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ A logarithmic approximation for polymatroid congestion games ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ Robust branch-and-cut-and-price for the capacitated vehicle routing problem ⋮ Leadership in singleton congestion games: what is hard and what is easy ⋮ Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications ⋮ Pure Nash equilibria in player-specific and weighted congestion games ⋮ Convergence Dynamics of Graphical Congestion Games

This page was built for publication: Finding minimum congestion spanning trees