The root location problem for arc-disjoint arborescences

DOI10.1016/J.DAM.2012.04.013MaRDI QIDQ442209zbMATH OpenOpenAlexFDO

Authors Satoru Fujishige, Naoyuki Kamiyama

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)

Recommendations

• The complexity of finding arc-disjoint branching flows
• A note on disjoint arborescences
• Disjoint paths in arborescences
• scientific article; zbMATH DE number 7692724

Cites work

• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 2080258 (Why is no real title available?)
• scientific article; zbMATH DE number 2152473 (Why is no real title available?)
• scientific article; zbMATH DE number 3404256 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• 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)
• Edge connectivity between nodes and node-subsets
• Locating sources to meet flow demands in undirected networks
• Locational analysis: highlights of growth to maturity
• The complexity of satisfiability problems
• Variations for Lovász’ Submodular Ideas

Cited in

(2)

• Sink location to find optimal shelters in evacuation planning
• The complexity of finding arc-disjoint branching flows

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442209)