Minimum cost source location problem with vertex-connectivity requirements in digraphs

DOI10.1016/S0020-0190(01)00183-1MaRDI QIDQ1607133zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito

Publication date 25 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(01)00183-1

zbMATH Keywords

digraphundirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)

Recommendations

• Minimum cost source location problem with local 3-vertex-connectivity requirements
• Approximating minimum cost source location problems with local vertex-connectivity demands
• Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
• Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
• The source location problem with local 3-vertex-connectivity requirements

Cites work

• scientific article; zbMATH DE number 1617268 (Why is no real title available?)
• scientific article; zbMATH DE number 2080258 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• scientific article; zbMATH DE number 956792 (Why is no real title available?)
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• A weighted matroid intersection algorithm
• Computing Vertex Connectivity: New Bounds from Old Techniques
• Edge connectivity between nodes and node-subsets
• Matroid intersection algorithms
• Network Flow and Testing Graph Connectivity
• On sparse subgraphs preserving connectivity properties

Cited in

(22)

• A note on two source location problems
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• Multi-commodity Source Location Problems and Price of Greed
• Minimum cost source location problem with local 3-vertex-connectivity requirements
• An algorithm for source location in directed graphs
• Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
• 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
• Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
• Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
• Static and dynamic source locations in undirected networks
• scientific article; zbMATH DE number 2152473 (Why is no real title available?)
• Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
• 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
• scientific article; zbMATH DE number 1617268 (Why is no real title available?)
• Approximating source location and star survivable network problems
• Locating sources to meet flow demands in undirected networks
• Maximum-cover source location problems with objective edge-connectivity three
• Approximating source location and star survivable network problems

This page was built for publication: Minimum cost source location problem with vertex-connectivity requirements in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607133)