Approximating minimum cost source location problems with local vertex-connectivity demands
From MaRDI portal
Publication:2434929
DOI10.1016/j.jda.2013.02.002zbMath1280.68294OpenAlexW2090952304MaRDI QIDQ2434929
Publication date: 3 February 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.02.002
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Improved approximation algorithms for minimum cost node-connectivity augmentation problems ⋮ Approximating source location and star survivable network problems ⋮ Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
Cites Work
- Unnamed Item
- Minimum cost source location problem with local 3-vertex-connectivity requirements
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Minimizing a monotone concave function with laminar covering constraints
- A note on two source location problems
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- Approximating node-connectivity augmentation problems
- 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
- Iterative Methods in Combinatorial Optimization
- A Greedy Heuristic for the Set-Covering Problem
- Source location problems considering vertex-connectivity and edge-connectivity simultaneously
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
This page was built for publication: Approximating minimum cost source location problems with local vertex-connectivity demands
