On minimal cost-reliability ratio spanning trees and related problems

  • Authors:

  • Yung-Cheng Chang;Lih-Hsing Hsu

  • Affiliations:

  • Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan 30050, ROC;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 30050, ROC

  • Venue:
  • Operations Research Letters
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

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 as 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(q^4) 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(q^3). Furthermore using our approach, related algorithms proposed by Hassin and Tamir can also be improved by a factor of O(a).