A linear time algorithm for connected \(p\)-centdian problem on block graphs

DOI10.1016/j.tcs.2022.05.019OpenAlexW4281555128MaRDI QIDQ2672632

Kien Trung Nguyen, Wen Chean Teh, Huong Nguyen-Thu, Nguyen Thanh Hung

Publication date: 13 June 2022

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.05.019

zbMATH Keywords

location problemlinear time algorithmblock graphscentdian problemconnected facilities

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Approximability results for the $p$-centdian and the converse centdian problems

Cites Work

• Unnamed Item
• The connected \(p\)-median problem on block graphs
• The connected \(p\)-center problem on block graphs with forbidden vertices
• Algorithms for connected \(p\)-centdian problem on block graphs
• The inverse connected \(p\)-median problem on block graphs under various cost functions
• A review of extensive facility location in networks
• The centdian subtree on tree networks
• The connected \(p\)-center problem on cactus graphs
• Extensive facility location problems on networks: an updated review
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• A polynomial algorithm for thep-centdian problem on a tree
• Multicriteria Optimization
• The connected p-median problem on complete multi-layered graphs
• The generalized \(p\)-centdian on network

This page was built for publication: A linear time algorithm for connected \(p\)-centdian problem on block graphs