Robustness of minimum cost arborescences
type: Item
instance of: scholarly article
title: Robustness of minimum cost arborescences
zbMATH Open document ID: 1254.90192
author: Naoyuki Kamiyama
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6119219
zbMATH Keywords: minimum arborescence problem
zbMATH Keywords: robustness
zbMATH Keywords: primal-dual algorithm
MaRDI profile type: Publication
full work available at URL: s13160-012-0079-8
OpenAlex ID: W1983650561
cites work: Q4500916
cites work: Q5645231
cites work: Q5567717
cites work: Optimum branchings
cites work: A weighted matroid intersection algorithm
cites work: Packing rooted directed cuts in a weighted directed graph
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: A note on k-shortest paths problem
cites work: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
cites work: Q3818127
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A dual approximation approach to weighted matroid intersection
DOI: 10.1007/S13160-012-0079-8
description: scientific article; zbMATH DE number 6119219