Algorithms for connected p-centdian problem on block graphs

DOI10.1007/S10878-016-0058-0MaRDI QIDQ724753zbMATH OpenOpenAlexFDO

Authors Jianjie Zhou, Erfang Shan, Liying 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

block graphscentdianconnected \(p\)-centermedian

Mathematics Subject Classification ID

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

Recommendations

• The connected \(p\)-centdian problem on block graphs
• The connected p-center problem on block graphs with forbidden vertices
• The connected p-median problem on block graphs
• The inverse connected p-median problem on block graphs under various cost functions
• The \(p\)-maxian problem on block graphs

Cites work

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

Cited in

(13)

• A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
• A linear time algorithm for connected \(p\)-centdian problem on block graphs
• An unweighted 1-center problem on block graphs
• The connected p-median problem on block graphs
• The connected \(p\)-centdian problem on block graphs
• Block-vertex duality and the one-median problem
• The backup 2-median problem on block graphs
• The connected p-center problem on block graphs with forbidden vertices
• The connected \(p\)-median problem on complete multi-layered graphs
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
• The \(p\)-maxian problem on block graphs
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724753)