The Connected p-Centdian Problem on Block Graphs

DOI10.1007/978-3-319-26626-8_37zbMath1473.90140OpenAlexW2404526138MaRDI QIDQ3467867

Jianjie Zhou, Erfang Shan, Li-ying Kang

Publication date: 5 February 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_37

zbMATH Keywords

medianblock graphsconnected \(p\)-centercentdian

Mathematics Subject Classification ID

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

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: The Connected p-Centdian Problem on Block Graphs