Approximate maximum weight branchings

DOI10.1016/j.ipl.2006.02.011zbMath1184.05058OpenAlexW2004019877MaRDI QIDQ845674

Ankur Bhargava, Torsten Suel, Amitabha Bagchi

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.02.011

zbMATH Keywords

analysis of algorithmsgraph algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items

Approximating optimum branchings in linear time

Uses Software

• zdelta
• GLIMPSE

Cites Work

• Unnamed Item
• A good algorithm for edge-disjoint branching
• Edge-disjoint spanning trees and depth-first search
• A note on finding optimum branchings
• Finding optimum branchings