Abstract:Given an undirected graph $G=(V,E)$ with a nonnegative edge length function
and an integer $p$, $0 < p < |V|$, the $p$-centdian problem is to find $p$
vertices (called the {\it centdian set}) of $V$ such that the {\it
eccentricity} plus {\it median-distance} is minimized, in which the {\it
eccentricity} is the maximum (length) distance of all vertices to their nearest
{\it centdian set} and the {\it median-distance} is the total (length) distance
of all vertices to their nearest {\it centdian set}. The {… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.