Robustness of minimum cost arborescences

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings
Pages130-139
Number of pages10
DOIs
Publication statusPublished - Dec 26 2011
Externally publishedYes
Event22nd International Symposium on Algorithms and Computation, ISAAC 2011 - Yokohama, Japan
Duration: Dec 5 2011Dec 8 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7074 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other22nd International Symposium on Algorithms and Computation, ISAAC 2011
CountryJapan
CityYokohama
Period12/5/1112/8/11

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

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