Robustness of minimum cost arborescences

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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
Volume29
Issue number3
DOIs
Publication statusPublished - Oct 1 2012

Fingerprint

Robustness
Directed graphs
Costs
Spanning tree
Undirected Graph
Directed Graph
Arc of a curve
Analogue
Graph in graph theory

All Science Journal Classification (ASJC) codes

  • Applied Mathematics
  • Engineering(all)

Cite this

Robustness of minimum cost arborescences. / Kamiyama, Naoyuki.

In: Japan Journal of Industrial and Applied Mathematics, Vol. 29, No. 3, 01.10.2012, p. 485-497.

Research output: Contribution to journalArticle

@article{0365e21f58194d5cb7355b55b51fb5f1,
title = "Robustness of minimum cost arborescences",
abstract = "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.",
author = "Naoyuki Kamiyama",
year = "2012",
month = "10",
day = "1",
doi = "10.1007/s13160-012-0079-8",
language = "English",
volume = "29",
pages = "485--497",
journal = "Japan Journal of Industrial and Applied Mathematics",
issn = "0916-7005",
publisher = "Springer Japan",
number = "3",

}

TY - JOUR

T1 - Robustness of minimum cost arborescences

AU - Kamiyama, Naoyuki

PY - 2012/10/1

Y1 - 2012/10/1

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

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

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

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

U2 - 10.1007/s13160-012-0079-8

DO - 10.1007/s13160-012-0079-8

M3 - Article

AN - SCOPUS:84870900513

VL - 29

SP - 485

EP - 497

JO - Japan Journal of Industrial and Applied Mathematics

JF - Japan Journal of Industrial and Applied Mathematics

SN - 0916-7005

IS - 3

ER -