Source location problems considering vertex-connectivity and edge-connectivity simultaneously
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2080258
- The source location problem with local 3-vertex-connectivity requirements
- Minimum cost source location problem with local 3-vertex-connectivity requirements
- Maximum-cover source location problems with objective edge-connectivity three
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
Cited in
(13)- A note on two source location problems
- Multi-commodity Source Location Problems and Price of Greed
- Minimum cost source location problem with local 3-vertex-connectivity requirements
- Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
- Approximating minimum cost source location problems with local vertex-connectivity demands
- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
- scientific article; zbMATH DE number 2080258 (Why is no real title available?)
- Static and dynamic source locations in undirected networks
- The source location problem with local 3-vertex-connectivity requirements
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
- Minimum cost source location problems with flow requirements
- Maximum-cover source location problems with objective edge-connectivity three
This page was built for publication: Source location problems considering vertex-connectivity and edge-connectivity simultaneously
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785221)