On the Location of a Constrained Tree Facility in a Tree Network with Unreliable Edges
Abdallah W. Aboutahoun () and
Eman Fares ()
Journal of Applied Mathematics, 2019, vol. 2019, 1-16
Given a tree network with 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 leaves and with a diameter of at most 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 â€“ tree core of is developed. The time complexity of the proposed algorithm is Examples are provided to illustrate the performance of the proposed algorithm.
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:9520324
Access Statistics for this article
More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().