Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
From MaRDI portal
Publication:3010423
DOI10.1007/978-3-642-20877-5_42zbMath1331.68152OpenAlexW1503759191MaRDI QIDQ3010423
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_42
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Internet topics (68M11)
Related Items (1)
Cites Work
- Unnamed Item
- 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
- 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
- The source location problem with local 3-vertex-connectivity requirements
- Minimum cost source location problems with flow requirements
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Locating Sources to Meet Flow Demands in Undirected Networks
- Approximating minimum bounded degree spanning trees to within one of optimal
- 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
