Algorithms of O(p. n. log n) time to find an (absolute or vertex) p-center on a weighted tree of n vertices are presented. Those algorithms represent ...

The weighted p-center problem is to find an optimal location for a set SP of p supply points (“centers”) such that r is minimized. We distinguish between two ...

We then propose a constructive, dynamic programming algorithm for CDBP on trees, that is able to simultaneously find a solution for all possible cardinalities.

We present two improved algorithms for weighted discrete p-center problem for tree networks with n vertices. One of our proposed algorithms runs in O(nlog n + ...

Jeger, M., Kariv, O.: Algorithms for finding p-centers on a weighted tree (for relatively small p). Networks 15, 381–389 (1985). Article MATH MathSciNet ...

Apr 25, 2024 · M. Jeger, Oded Kariv: Algorithms for finding P-centers on a weighted tree (for relatively small P). Networks 15(3): 381-389 (1985); 1984.

Algorithms for finding P-centers on a weighted tree (for relatively small P) ... Two improved algorithms for weighted discrete p-center problem for tree ...

Jeger, M., Kariv, O.: Algorithms for finding p-centers on a weighted tree (for relatively small p). Networks 15, 381-389 (1985). Crossref · Google Scholar. [9].

Two improved algorithms for weighted discrete p-center problem for tree networks withTree networks with $n$ vertices are presented, one of which is more ...

Algorithms for finding P‐centers on a weighted tree (for relatively small P). Networks, Vol. 15, No. 3 | 11 October 2006. Efficient implementation of a ...