Maximum-cover source location problems with objective edge-connectivity three

DOI10.1007/s00186-008-0266-1zbMath1176.90615OpenAlexW1991712569MaRDI QIDQ836873

Hiro Ito, Kenya Sugihara

Publication date: 9 September 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-008-0266-1

zbMATH Keywords

polynomial-time algorithmNP-hard

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (1)

Static and dynamic source locations in undirected networks

Cites Work

• Unnamed Item
• Unnamed Item
• A simple 3-edge-connected component algorithm
• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• An algorithm for source location in directed graphs
• The source location problem with local 3-vertex-connectivity requirements
• Locating Sources to Meet Flow Demands in Undirected Networks
• Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
• Edge connectivity between nodes and node-subsets
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously

This page was built for publication: Maximum-cover source location problems with objective edge-connectivity three