Robustness of minimum cost arborescences

Naoyuki Kamiyama

doi:10.1007/978-3-642-25591-5_15

Robustness of minimum cost arborescences

Naoyuki Kamiyama

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings
Pages	130-139
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-642-25591-5_15
Publication status	Published - Dec 26 2011
Externally published	Yes
Event	22nd International Symposium on Algorithms and Computation, ISAAC 2011 - Yokohama, Japan Duration: Dec 5 2011 → Dec 8 2011

Publication series

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

Other

Other	22nd International Symposium on Algorithms and Computation, ISAAC 2011
Country/Territory	Japan
City	Yokohama
Period	12/5/11 → 12/8/11

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-25591-5_15

Cite this

Robustness of minimum cost arborescences. / Kamiyama, Naoyuki.

Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings. 2011. p. 130-139 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7074 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

@inproceedings{f7e1ebd8cf5147c8ba98f7f371aef0bf,

title = "Robustness of minimum cost arborescences",

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.",

author = "Naoyuki Kamiyama",

year = "2011",

month = dec,

day = "26",

doi = "10.1007/978-3-642-25591-5_15",

language = "English",

isbn = "9783642255908",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "130--139",

booktitle = "Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings",

note = "22nd International Symposium on Algorithms and Computation, ISAAC 2011 ; Conference date: 05-12-2011 Through 08-12-2011",

}

TY - GEN

T1 - Robustness of minimum cost arborescences

AU - Kamiyama, Naoyuki

PY - 2011/12/26

Y1 - 2011/12/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84055217350&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84055217350&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25591-5_15

DO - 10.1007/978-3-642-25591-5_15

M3 - Conference contribution

AN - SCOPUS:84055217350

SN - 9783642255908

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 130

EP - 139

BT - Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings

T2 - 22nd International Symposium on Algorithms and Computation, ISAAC 2011

Y2 - 5 December 2011 through 8 December 2011

ER -

Robustness of minimum cost arborescences

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this