The root location problem for arc-disjoint arborescences

Satoru Fujishige, Naoyuki Kamiyama

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we consider two location problems of determining the best location of roots of arc-disjoint arborescences in a network. In the first problem, we are given prescribed vertex subsets and the problem asks for finding the best location of roots of arc-disjoint arborescences that span these vertex subsets. We show that this problem is NP-hard in general and that it can be solved in polynomial time in the case where the prescribed vertex subsets are convex. In the second problem, we are given a demand d(v) for each vertex v and the problem asks for finding the best location of roots of arc-disjoint arborescences such that each vertex v is contained in at least d(v) arborescences. We show that this problem is NP-hard in general.

Original languageEnglish
Pages (from-to)1964-1970
Number of pages7
JournalDiscrete Applied Mathematics
Volume160
Issue number13-14
DOIs
Publication statusPublished - Sep 1 2012

Fingerprint

Location Problem
Disjoint
Arc of a curve
Roots
Vertex of a graph
Computational complexity
Subset
NP-complete problem
Polynomials
Polynomial time

All Science Journal Classification (ASJC) codes

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

The root location problem for arc-disjoint arborescences. / Fujishige, Satoru; Kamiyama, Naoyuki.

In: Discrete Applied Mathematics, Vol. 160, No. 13-14, 01.09.2012, p. 1964-1970.

Research output: Contribution to journalArticle

Fujishige, Satoru ; Kamiyama, Naoyuki. / The root location problem for arc-disjoint arborescences. In: Discrete Applied Mathematics. 2012 ; Vol. 160, No. 13-14. pp. 1964-1970.
@article{9cbc7bf878e24a6695e13f8b2faf5df6,
title = "The root location problem for arc-disjoint arborescences",
abstract = "In this paper, we consider two location problems of determining the best location of roots of arc-disjoint arborescences in a network. In the first problem, we are given prescribed vertex subsets and the problem asks for finding the best location of roots of arc-disjoint arborescences that span these vertex subsets. We show that this problem is NP-hard in general and that it can be solved in polynomial time in the case where the prescribed vertex subsets are convex. In the second problem, we are given a demand d(v) for each vertex v and the problem asks for finding the best location of roots of arc-disjoint arborescences such that each vertex v is contained in at least d(v) arborescences. We show that this problem is NP-hard in general.",
author = "Satoru Fujishige and Naoyuki Kamiyama",
year = "2012",
month = "9",
day = "1",
doi = "10.1016/j.dam.2012.04.013",
language = "English",
volume = "160",
pages = "1964--1970",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "13-14",

}

TY - JOUR

T1 - The root location problem for arc-disjoint arborescences

AU - Fujishige, Satoru

AU - Kamiyama, Naoyuki

PY - 2012/9/1

Y1 - 2012/9/1

N2 - In this paper, we consider two location problems of determining the best location of roots of arc-disjoint arborescences in a network. In the first problem, we are given prescribed vertex subsets and the problem asks for finding the best location of roots of arc-disjoint arborescences that span these vertex subsets. We show that this problem is NP-hard in general and that it can be solved in polynomial time in the case where the prescribed vertex subsets are convex. In the second problem, we are given a demand d(v) for each vertex v and the problem asks for finding the best location of roots of arc-disjoint arborescences such that each vertex v is contained in at least d(v) arborescences. We show that this problem is NP-hard in general.

AB - In this paper, we consider two location problems of determining the best location of roots of arc-disjoint arborescences in a network. In the first problem, we are given prescribed vertex subsets and the problem asks for finding the best location of roots of arc-disjoint arborescences that span these vertex subsets. We show that this problem is NP-hard in general and that it can be solved in polynomial time in the case where the prescribed vertex subsets are convex. In the second problem, we are given a demand d(v) for each vertex v and the problem asks for finding the best location of roots of arc-disjoint arborescences such that each vertex v is contained in at least d(v) arborescences. We show that this problem is NP-hard in general.

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

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

U2 - 10.1016/j.dam.2012.04.013

DO - 10.1016/j.dam.2012.04.013

M3 - Article

AN - SCOPUS:84862205574

VL - 160

SP - 1964

EP - 1970

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 13-14

ER -