The root location problem for arc-disjoint arborescences

DOI10.1016/j.dam.2012.04.013zbMath1250.90048OpenAlexW2017404024MaRDI QIDQ442209

Naoyuki Kamiyama, Satoru Fujishige

Publication date: 10 August 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.013

zbMATH Keywords

convex setsarc-disjoint arborescencesroot location problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

Sink location to find optimal shelters in evacuation planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on disjoint arborescences
• An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
• Arc-disjoint in-trees in directed graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Locating Sources to Meet Flow Demands in Undirected Networks
• Locational analysis: highlights of growth to maturity
• Variations for Lovász’ Submodular Ideas
• Edge connectivity between nodes and node-subsets
• The complexity of satisfiability problems

This page was built for publication: The root location problem for arc-disjoint arborescences