Robustness of minimum cost arborescences
From MaRDI portal
Publication:1926648
DOI10.1007/s13160-012-0079-8zbMath1254.90192OpenAlexW1983650561MaRDI QIDQ1926648
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
Related Items
Blocking unions of arborescences, Investigation on irreducible cost vectors in minimum cost arborescence problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A dual approximation approach to weighted matroid intersection
- A note on k-shortest paths problem
- A weighted matroid intersection algorithm
- Packing rooted directed cuts in a weighted directed graph
- Optimum branchings