Minimum cost source location problem with local 3-vertex-connectivity requirements

DOI10.1016/j.tcs.2006.11.010zbMath1110.68101OpenAlexW2155629733MaRDI QIDQ870842

Hiroshi Nagamochi, Toshimasa Ishii, Hitoshi Fujita

Publication date: 15 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10252/98

zbMATH Keywords

location problemgraph algorithmpolynomial time algorithmundirected graphlocal vertex-connectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (5)

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 ⋮ Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• Polyhedral structure of submodular and posi-modular systems
• The source location problem with local 3-vertex-connectivity requirements
• Locating Sources to Meet Flow Demands in Undirected Networks
• Minimum Cost Source Location Problems with Flow Requirements
• Edge connectivity between nodes and node-subsets
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• Mathematical Foundations of Computer Science 2003

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