Skip to main content
Conference Proceedings

Robustness of minimum cost arborescences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 7074 LNCS 130-139
DOI: 10.1007/978-3-642-25591-5_15
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Kamiyama, N. (2011). Robustness of minimum cost arborescences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7074 LNCS, pp. 130–139). https://doi.org/10.1007/978-3-642-25591-5_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free