Approximating source location and star survivable network problems
From MaRDI portal
Publication:528470
DOI10.1016/j.tcs.2017.02.008zbMath1378.90083OpenAlexW2589799731MaRDI QIDQ528470
Publication date: 12 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.008
Related Items (3)
Approximating \(k\)-connected \(m\)-dominating sets ⋮ Approximating k-Connected m-Dominating Sets ⋮ On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
Cites Work
- Unnamed Item
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Tight approximation algorithm for connectivity augmentation problems
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
- An application of submodular flows
- 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
- An algorithm for source location in directed graphs
- An analysis of the greedy algorithm for the submodular set covering problem
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Approximating node-connectivity augmentation problems
- Approximating minimum cost source location problems with local vertex-connectivity demands
- Minimum cost source location problems with flow requirements
- Locating Sources to Meet Flow Demands in Undirected Networks
- Approximating minimum-cost connectivity problems via uncrossable bifamilies
- Algorithmic Aspects of Graph Connectivity
- On sparse subgraphs preserving connectivity properties
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
This page was built for publication: Approximating source location and star survivable network problems
