Approximating optimum branchings in linear time
type: Item
instance of: scholarly article
title: Approximating optimum branchings in linear time
zbMATH Open document ID: 1191.68879
author: V. Ziegler
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5721966
zbMATH Keywords: approximation algorithm
zbMATH Keywords: graph algorithm
zbMATH Keywords: branching
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.09.022
OpenAlex ID: W2003027801
cites work: Approximate maximum weight branchings
cites work: Q5645231
cites work: Q5567717
cites work: Optimum branchings
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: A simple derivation of edmonds' algorithm for optimum branchings
cites work: Combinatorial optimization. Theory and applications.
DOI: 10.1016/J.IPL.2008.09.022
description: scientific article; zbMATH DE number 5721966