An efficient scaling algorithm for the minimum weight bibranching problem
type: Item
instance of: scholarly article
title: An efficient scaling algorithm for the minimum weight bibranching problem
zbMATH Open document ID: 1275.68157
author: Maxim Babenko
published in: Algorithmica
publication date: 2011-12-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5988472
zbMATH Keywords: branching
zbMATH Keywords: bipartite edge cover
zbMATH Keywords: weight scaling
zbMATH Keywords: primal-dual algorithm
zbMATH Keywords: blocking augmentation
MaRDI profile type: Publication
full work available at URL: s00453-009-9377-1
OpenAlex ID: W2068452881
cites work: An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
cites work: Introduction to algorithms
cites work: Optimum branchings
cites work: How to make a digraph strongly connected
cites work: Q3140422
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: Faster Scaling Algorithms for Network Problems
cites work: Faster scaling algorithms for general graph matching problems
cites work: An efficient algorithm for minimum-weight bibranching
cites work: Min-max Relations for Directed Graphs
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A data structure for dynamic trees
cites work: Q3707420
DOI: 10.1007/S00453-009-9377-1
description: scientific article; zbMATH DE number 5988472