Exact arborescences, matchings and cycles
Discrete Applied Mathematics
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Bicriteria network design problems
Journal of Algorithms
Introduction to Algorithms
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Interval data minmax regret network optimization problems
Discrete Applied Mathematics
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
The robust minimum spanning tree problem: Compact and convex uncertainty
Operations Research Letters
On the complexity of the robust spanning tree problem with interval data
Operations Research Letters
On the hardness of evaluating criticality of activities in a planar network with duration intervals
Operations Research Letters
The robust spanning tree problem with interval data
Operations Research Letters
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
On the minimum risk-sum path problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
This paper studies a spanning tree problem with interval data that finds diverse applications in network design. Given an underlying network G = (V,E), each link e ∈ E can be established by paying a cost ce ∈ [ce, ce], and accordingly takes a risk ce-ce/ce-ce of link failure. The minimum risk spanning tree (MRST) problem is to establish a spanning tree in G of total cost no more than a given constant so that the risk sum over the links on the spanning tree is minimized. In this paper, we propose an exact algorithm for the MRST problem that has time-complexity of O(m2 log m log n(m + n log n)), where m = |E| and n = |V|.