On minimal cost-reliability ratio spanning trees and related problems

On minimal cost-reliability ratio spanning trees and related problems

0.00 Avg rating0 Votes
Article ID: iaor1998332
Country: Netherlands
Volume: 19
Issue: 3
Start Page Number: 65
End Page Number: 69
Publication Date: Aug 1996
Journal: Operations Research Letters
Authors: ,
Keywords: networks
Abstract:

The minimal cost-reliability ratio spanning tree problem is to find a spanning tree such that the cost-reliability ratio is minimized. This problem can also be treated a a specific version of a more generalized problem discussed by Hassin and Tamir. By Hassin and Tamir’s approach, the minimal cost-reliability ratio spanning tree problem can be solved in O(q4) where q is the number of edges in the graph. In this paper, we reduce the complexity of the algorithm proposed by Hassin and Tamir to O(q3). Furthermore, using our approach, related algorithms proposed by Hassin and Tamir can also be improved by a factor of O(q).

Reviews

Required fields are marked *. Your email address will not be published.