Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
From MaRDI portal
Publication:1044047
DOI10.1016/j.jda.2009.06.003zbMath1183.90278OpenAlexW2037065294MaRDI QIDQ1044047
Publication date: 10 December 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.06.003
Related Items (5)
Static and dynamic source locations in undirected networks ⋮ Approximating minimum cost source location problems with local vertex-connectivity demands ⋮ Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands ⋮ Approximating source location and star survivable network problems ⋮ Approximating Source Location and Star Survivable Network Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum cost source location problem with local 3-vertex-connectivity requirements
- A note on two source location problems
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Some APX-completeness results for cubic graphs
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- An algorithm for source location in directed graphs
- The source location problem with local 3-vertex-connectivity requirements
- Minimum cost source location problems with flow requirements
- Locating Sources to Meet Flow Demands in Undirected Networks
- Algorithmic Aspects of Graph Connectivity
- Network Flow and Testing Graph Connectivity
- Source location problems considering vertex-connectivity and edge-connectivity simultaneously
- Transversals of subtree hypergraphs and the source location problem in digraphs
This page was built for publication: Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
