The Connected p-Center Problem on Cactus Graphs

DOI10.1007/978-3-319-48749-6_53zbMath1421.90123OpenAlexW2541450334MaRDI QIDQ2958359

Chun-song Bai, Erfang Shan, Li-ying Kang

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_53

zbMATH Keywords

dynamic programminglocation problemcactus graphconnected \(p\)-center problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• The connected \(p\)-center problem on block graphs with forbidden vertices
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• A simple linear-time algorithm for computing the center of an interval graph
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians

This page was built for publication: The Connected p-Center Problem on Cactus Graphs