Algorithms for connected \(p\)-centdian problem on block graphs

DOI10.1007/s10878-016-0058-0zbMath1421.90126OpenAlexW2471687126MaRDI QIDQ724753

Erfang Shan, Jianjie Zhou, Li-ying Kang

Publication date: 26 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0058-0

zbMATH Keywords

medianblock graphsconnected \(p\)-centercentdian

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (5)

The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ A linear time algorithm for connected \(p\)-centdian problem on block graphs ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ The connected p-median problem on complete multi-layered graphs

Cites Work

• The connected \(p\)-center problem on block graphs with forbidden vertices
• Algorithms for central-median paths with bounded length on trees
• A characterization of block graphs
• The centdian subtree on tree networks
• Algorithms for path medi-centers of a tree
• Medi-Centers of a Tree
• Block-vertex duality and the one-median problem
• From the median to the generalized center
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph

This page was built for publication: Algorithms for connected \(p\)-centdian problem on block graphs