The location of central structures in trees
Computers and Operations Research
Algorithms for a core and k-tree core of a tree
Journal of Algorithms
Data Structures and Algorithms
Data Structures and Algorithms
Extensive facility location problems on networks with equity measures
Discrete Applied Mathematics
Range minimization problems in path-facility location on trees
Discrete Applied Mathematics
| Hi-index | 0.00 |
Extensive facility location models on graphs deal with the location of a special type of subgraphs such as paths, trees or cycles and can be considered as extensions of classical point location models. Variance is one of the measures applied in models in which some equality requirement is imposed. In this paper the problem of locating a minimum variance path in a tree network is addressed, and an O(n2 log n) time algorithm is porposed.