O PROBLEMA DESPRE CENTRUL PROBABILIST AL ARBORELUI

Andrei PO¸STARU, Daniela MOFTULEAC. Catedra Informatica ¸si Optimizare Discreta

Abstract

In this paper we consider the weighted minimax (1-center) location problem on the tree with uniform distributed weights. The set of the T-centres and one algorithm of a Önding of the center of a tree with constant wieghteds is described.