Translator Disclaimer
2019 On the Location of a Constrained k - Tree Facility in a Tree Network with Unreliable Edges
Abdallah W. Aboutahoun, Eman Fares
J. Appl. Math. 2019: 1-16 (2019). DOI: 10.1155/2019/9520324


Given a tree network T with n vertices where each edge has an independent operational probability, we are interested in finding the optimal location of a reliable service provider facility in a shape of subtree with exactly k leaves and with a diameter of at most l which maximizes the expected number of nodes that are reachable from the selected subtree by operational paths. Demand requests for service originate at perfectly reliable nodes. So, the major concern of this paper is to find a location of a reliable tree-shaped facility on the network in order to provide a maximum access to network services by ensuring the highest level of network connectivity between the demand nodes and the facility. An efficient algorithm for finding a reliable ( k , l ) – tree core of T is developed. The time complexity of the proposed algorithm is O l k n . Examples are provided to illustrate the performance of the proposed algorithm.


Download Citation

Abdallah W. Aboutahoun. Eman Fares. "On the Location of a Constrained k - Tree Facility in a Tree Network with Unreliable Edges." J. Appl. Math. 2019 1 - 16, 2019.


Received: 20 March 2019; Accepted: 24 July 2019; Published: 2019
First available in Project Euclid: 19 September 2019

zbMATH: 07165631
MathSciNet: MR3998947
Digital Object Identifier: 10.1155/2019/9520324

Rights: Copyright © 2019 Hindawi


This article is only available to subscribers.
It is not available for individual sale.

Vol.2019 • 2019
Back to Top