The root location problem for arc-disjoint arborescences

DOI10.1016/J.DAM.2012.04.013zbMATH Open1250.90048OpenAlexW2017404024MaRDI QIDQ442209FDOQ442209

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

Recommendations

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

zbMATH Keywords

convex setsarc-disjoint arborescencesroot location problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Title not available (Why is that?)
• The complexity of satisfiability problems
• Title not available (Why is that?)
• Locational analysis: highlights of growth to maturity
• Variations for Lovász’ Submodular Ideas
• A note on disjoint arborescences
• Locating sources to meet flow demands in undirected networks
• Title not available (Why is that?)
• Edge connectivity between nodes and node-subsets
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
• Arc-disjoint in-trees in directed graphs

Cited In (2)

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

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)