An algorithm for source location in directed graphs

DOI10.1016/J.ORL.2004.07.005MaRDI QIDQ1779694zbMATH OpenOpenAlexWikidataFDO

Authors Mihály Bárász, Johanna Becker, András Frank

Publication date 1 June 2005

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2004.07.005

zbMATH Keywords

Edge-connectivityPolynomial algorithmSource location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 2152473
• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• A note on two source location problems
• Source location in undirected and directed hypergraphs
• The source location problem with local 3-vertex-connectivity requirements

Cites work

• scientific article; zbMATH DE number 3513839 (Why is no real title available?)
• scientific article; zbMATH DE number 1175956 (Why is no real title available?)
• scientific article; zbMATH DE number 2152473 (Why is no real title available?)
• scientific article; zbMATH DE number 863476 (Why is no real title available?)
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Combinatorial Optimization with Rational Objective Functions
• Edge-connectivity augmentation problems
• Transversals of subtree hypergraphs and the source location problem in digraphs

Cited in

(15)

• Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
• Maximum-cover source location problems with objective edge-connectivity three
• scientific article; zbMATH DE number 1985668 (Why is no real title available?)
• Transversals of subtree hypergraphs and the source location problem in digraphs
• Blocking unions of arborescences
• scientific article; zbMATH DE number 2152473 (Why is no real title available?)
• Graph orientations with set connectivity requirements
• Minimum cost source location problems with flow requirements
• Finding k Disjoint Paths in a Directed Planar Graph
• Source location with rigidity and tree packing requirements
• Source location in undirected and directed hypergraphs
• Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
• Static and dynamic source locations in undirected networks
• scientific article; zbMATH DE number 3861196 (Why is no real title available?)
• Approximating source location and star survivable network problems

This page was built for publication: An algorithm for source location in directed graphs

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