The root location problem for arc-disjoint arborescences
type: Item
instance of: scholarly article
title: The root location problem for arc-disjoint arborescences
zbMATH Open document ID: 1250.90048
author: Satoru Fujishige
author: Naoyuki Kamiyama
published in: Discrete Applied Mathematics
publication date: 2012-08-10T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6064584
zbMATH Keywords: arc-disjoint arborescences
zbMATH Keywords: root location problems
zbMATH Keywords: convex sets
MaRDI profile type: Publication
full work available at URL: j.dam.2012.04.013
OpenAlex ID: W2017404024
cites work: Locating sources to meet flow demands in undirected networks
cites work: Variations for Lovász’ Submodular Ideas
cites work: Q5684698
cites work: A note on disjoint arborescences
cites work: Q4472509
cites work: Q4664045
cites work: Edge connectivity between nodes and node-subsets
cites work: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
cites work: Arc-disjoint in-trees in directed graphs
cites work: Q5670638
cites work: Q3993417
cites work: The complexity of satisfiability problems
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Locational analysis: highlights of growth to maturity
DOI: 10.1016/J.DAM.2012.04.013
description: scientific article; zbMATH DE number 6064584