Robustness of minimum cost arborescences

DOI10.1007/S13160-012-0079-8MaRDI QIDQ1926648zbMATH OpenOpenAlexFDO

Authors Naoyuki Kamiyama

Publication date 28 December 2012

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13160-012-0079-8

zbMATH Keywords

minimum arborescence problemprimal-dual algorithmrobustness

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Robustness of minimum cost arborescences
• Arborescence problems in directed graphs: theorems and algorithms
• scientific article; zbMATH DE number 7692724
• Minimax regret spanning arborescences under uncertain costs

Cites work

• A dual approximation approach to weighted matroid intersection
• A note on k-shortest paths problem
• A weighted matroid intersection algorithm
• An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 3285076 (Why is no real title available?)
• scientific article; zbMATH DE number 3373559 (Why is no real title available?)
• Optimum branchings
• Packing rooted directed cuts in a weighted directed graph

Cited in

(6)

• Blocking unions of arborescences
• Investigation on irreducible cost vectors in minimum cost arborescence problems
• Dispersal routes reconstruction and the minimum cost arborescence problem
• Robustness of minimum cost arborescences
• A randomly weighted minimum arborescence with a random cost constraint
• Arborescence problems in directed graphs: theorems and algorithms

This page was built for publication: Robustness of minimum cost arborescences

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