On the complexity of the robust spanning tree problem with interval data

Authors:
Ionu D. Aron;Pascal Van Hentenryck
Affiliations:
Department of Computer Science, Brown University, Box 1910, Providence, RI 02912, USA;Department of Computer Science, Brown University, Box 1910, Providence, RI 02912, USA
Venue:
Operations Research Letters
Year:
2004

Citing 5
Cited 24

On Central Spanning Trees of a Graph

Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
On central trees of a graph

Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms
A branch and bound algorithm for the robust spanning tree problem with interval data

A branch and bound algorithm for the robust spanning tree problem with interval data
A constraint satisfaction approach to the robust spanning tree problem with interval data

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
The robust spanning tree problem with interval data

Operations Research Letters

Robust inference of trees

Annals of Mathematics and Artificial Intelligence
An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters
A Branch and Bound algorithm for the minimax regret spanning arborescence

Journal of Global Optimization
The minimum spanning tree problem with fuzzy costs

Fuzzy Optimization and Decision Making
Simulated annealing algorithm for the robust spanning tree problem

Journal of Heuristics
Choosing robust solutions in discrete optimization problems with fuzzy costs

Fuzzy Sets and Systems
On the approximability of minmax (regret) network optimization problems

Information Processing Letters
Improved polynomial algorithms for robust bottleneck problems with interval data

Computers and Operations Research
An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters
The minimum risk spanning tree problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Some tractable instances of interval data minmax regret problems: bounded distance from triviality

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Heuristics for the central tree problem

Journal of Heuristics
A relaxation algorithm with a probabilistic guarantee for robust deviation optimization

Computational Optimization and Applications
Efficient algorithms for the prize collecting Steiner tree problems with interval data

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Deterministic risk control for cost-effective network connections

Theoretical Computer Science
Complexity of the min-max (regret) versions of cut problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Some tractable instances of interval data minmax regret problems

Operations Research Letters
The robust minimum spanning tree problem: Compact and convex uncertainty

Operations Research Letters
Minmax regret bottleneck problems with solution-induced interval uncertainty structure

Discrete Optimization
Complexity of the min-max (regret) versions of min cut problems

Discrete Optimization
Computing and minimizing the relative regret in combinatorial optimization with interval data

Discrete Optimization
Complexity of the min-max and min-max regret assignment problems

Operations Research Letters
The balanced minimum evolution problem under uncertain data

Discrete Applied Mathematics
On exact solutions for the Minmax Regret Spanning Tree problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the complexity of the robust spanning tree problem with interval data (RSTID). It shows that the problem is NP-complete, settling the conjecture of Kouvelis and Yu, and that it remains so for complete graphs or when the intervals are all [0,1]. These results indicate that the difficulty of RSTID stems from both the graph topology and the structure of the cost intervals, suggesting new directions for search algorithms.