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

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The root location problem for arc-disjoint arborescences'. Together they form a unique fingerprint.

  • Cite this