An algorithm for source location in directed graphs

DOI10.1016/j.orl.2004.07.005zbMath1177.90243OpenAlexW2084815677WikidataQ56987179 ScholiaQ56987179MaRDI QIDQ1779694

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

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

Polynomial algorithmEdge-connectivitySource location

Mathematics Subject Classification ID

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

Related Items (11)

Maximum-cover source location problems with objective edge-connectivity three ⋮ Source location with rigidity and tree packing requirements ⋮ Static and dynamic source locations in undirected networks ⋮ Graph orientations with set connectivity requirements ⋮ Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs ⋮ Source location in undirected and directed hypergraphs ⋮ Blocking optimal arborescences ⋮ Blocking unions of arborescences ⋮ Approximating source location and star survivable network problems ⋮ Minimum cost source location problems with flow requirements ⋮ Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-connectivity augmentation problems
• Combinatorial Optimization with Rational Objective Functions
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Transversals of subtree hypergraphs and the source location problem in digraphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

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