Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three

DOI10.1016/j.endm.2006.06.073zbMath1134.90437OpenAlexW2027057486MaRDI QIDQ3439496

Hiro Ito, Kenya Sugihara

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.073

zbMATH Keywords

dynamic programmingedge-connectivitysource location problem\(k\)-edge-connected component

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80) Connectivity (05C40)

Related Items (4)

Maximum-cover source location problems with objective edge-connectivity three ⋮ Static and dynamic source locations in undirected networks ⋮ Multi-commodity Source Location Problems and Price of Greed ⋮ Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three

Cites Work

• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• Locating Sources to Meet Flow Demands in Undirected Networks
• Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously

This page was built for publication: Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three