Approximating optimum branchings in linear time

DOI10.1016/J.IPL.2008.09.022zbMATH Open1191.68879OpenAlexW2003027801MaRDI QIDQ976065FDOQ976065

Authors: V. Ziegler 

Publication date: 16 June 2010

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

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

Recommendations

• Approximate maximum weight branchings
• Linear-time approximation for maximum weight matching
• Linear time approximation algorithms for~degree~constrained subgraph problems
• An efficient algorithm for minimum-weight bibranching
• Approximating Maximum Leaf Spanning Trees in Almost Linear Time

zbMATH Keywords

approximation algorithmbranchinggraph algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• Optimum branchings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Combinatorial optimization. Theory and applications.
• A simple derivation of edmonds' algorithm for optimum branchings
• Approximate maximum weight branchings

Cited In (6)

• Constructive linear time algorithms for branchwidth
• Approximate maximum weight branchings
• Effective branching splitting method under cost constraint
• Branching of solutions of linear time-optimal problem at an irregular point
• Optimal procedures and complexity analyses of nonserial converging branch networks
• Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

This page was built for publication: Approximating optimum branchings in linear time

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