An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem

DOI10.1007/978-3-540-92182-0_23MaRDI QIDQ3596721zbMATH OpenOpenAlexFDO

Authors Maxim Babenko

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_23

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• An efficient scaling algorithm for the minimum weight bibranching problem
• An efficient algorithm for minimum-weight bibranching
• Relationship of two formulations for shortest bibranchings
• The \(b\)-branching problem in digraphs
• scientific article; zbMATH DE number 7378329

Cited in

(4)

• An efficient algorithm for minimum-weight bibranching
• Relationship of two formulations for shortest bibranchings
• The \(b\)-branching problem in digraphs
• An efficient scaling algorithm for the minimum weight bibranching problem

This page was built for publication: An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem

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