Source location problems considering vertex-connectivity and edge-connectivity simultaneously
From MaRDI portal
Publication:4785221
DOI10.1002/net.10034zbMath1098.05076OpenAlexW2085678906MaRDI QIDQ4785221
Mitsuo Yokoyama, Kazuhiro Nakai, Hideyuki Uehara, Yuichiro Itatsu, Hiro Ito, Motoyasu Ito
Publication date: 17 December 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10034
Related Items
Maximum-cover source location problems with objective edge-connectivity three ⋮ Minimum cost source location problem with local 3-vertex-connectivity requirements ⋮ Static and dynamic source locations in undirected networks ⋮ Approximating minimum cost source location problems with local vertex-connectivity demands ⋮ Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs ⋮ Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands ⋮ Minimum cost source location problems with flow requirements ⋮ Multi-commodity Source Location Problems and Price of Greed ⋮ A note on two source location problems ⋮ Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs ⋮ Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
Cites Work
