Title: On minimal cost-reliability ratio spanning trees and related problems
Authors: Chang, YC
Hsu, LH
資訊工程學系
Department of Computer Science
Keywords: combinatorial algorithms;complexity;spanning trees
Issue Date: 1-Aug-1996
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(q).
URI: http://dx.doi.org/10.1016/0167-6377(96)00014-4
http://hdl.handle.net/11536/1152
ISSN: 0167-6377
DOI: 10.1016/0167-6377(96)00014-4
Journal: OPERATIONS RESEARCH LETTERS
Volume: 19
Issue: 2
Begin Page: 65
End Page: 69
Appears in Collections:Articles


Files in This Item:

  1. A1996VF92200003.pdf