Robustness of minimum cost arborescences

Authors:
Naoyuki Kamiyama
Affiliations:
Department of Information and System Engineering, Chuo University, Japan
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 5
Cited 1

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay

IEEE Transactions on Mobile Computing
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths

Discrete Applied Mathematics
A note on k-shortest paths problem

Journal of Graph Theory

Blocking optimal arborescences

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the minimum cost arborescence problem in a directed graph from the viewpoint of robustness of the optimal objective value. More precisely, we characterize an input graph in which the optimal objective value does not change even if we remove several arcs. Our characterizations lead to efficient algorithms for checking robustness of an input graph.