Edge capacity augmentation problem on spanning trees in networks

MaRDI QIDQ4980319zbMATH OpenFDO

Authors Juanping Zhu, Xuting Wu, Zilan Yang

Publication date 30 June 2014

zbMATH Keywords

\(T\)-exchangeedge capacity augmentationlexicographical orderspanning treestrong polynomial algorithm

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Programming involving graphs or networks (90C35)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• scientific article; zbMATH DE number 1405676
• scientific article; zbMATH DE number 871953
• Increasing the Weight of Minimum Spanning Trees

Cited in

(1)

• The capacity formulation of the capacitated edge activation problem

This page was built for publication: Edge capacity augmentation problem on spanning trees in networks

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