A note on two source location problems

DOI10.1016/j.jda.2006.12.010zbMath1160.90552OpenAlexW1972291887MaRDI QIDQ1018105

Zeev Nutov, Guy Kortsarz

Publication date: 13 May 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.12.010

zbMATH Keywords

approximationflowsourcelocation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Static and dynamic source locations in undirected networks ⋮ Approximating minimum cost source location problems with local vertex-connectivity demands ⋮ Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs

Cites Work

• Unnamed Item
• On the ratio of optimal integral and fractional covers
• Generalized submodular cover problems and applications
• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• Locating Sources to Meet Flow Demands in Undirected Networks
• Minimum Cost Source Location Problems with Flow Requirements
• Multi-Terminal Network Flows
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques