Finding minimum congestion spanning trees

DOI10.1145/351827.384253MaRDI QIDQ5463408zbMATH OpenOpenAlexFDO

Authors Renato F. Werneck, João C. Setubal

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)

Recommendations

• Minimum congestion spanning trees in planar graphs
• scientific article; zbMATH DE number 437549
• Complexity results for the spanning tree congestion problem
• Minimum congestion spanning trees in bipartite and random graphs
• scientific article; zbMATH DE number 3891405

Cited in

(11)

• Pure Nash equilibria in player-specific and weighted congestion games
• A logarithmic approximation for polymatroid congestion games
• Combinatorial optimization with interaction costs: complexity and solvable cases
• Leadership in singleton congestion games: what is hard and what is easy
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Convergence Dynamics of Graphical Congestion Games
• Finding totally independent spanning trees with linear integer programming
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Performance Oriented Spanning Trees
• Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
• On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms

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

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