Robustness of minimum cost arborescences

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


The minimum cost arborescence problem is a directed graph analogue of theminimum spanning tree problem in an undirected graph. In this paper, we study the minimum cost arborescence problem from the viewpoint of robustness of the optimal objective value, and we characterize an input graph in which the optimal objective value does not change even if we remove several arcs.

Original languageEnglish
Pages (from-to)485-497
Number of pages13
JournalJapan Journal of Industrial and Applied Mathematics
Issue number3
Publication statusPublished - Oct 2012

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Applied Mathematics


Dive into the research topics of 'Robustness of minimum cost arborescences'. Together they form a unique fingerprint.

Cite this