Computing All Small Cuts in an Undirected Network
SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Interval data minmax regret network optimization problems
Discrete Applied Mathematics
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Multicriteria global minimum cuts
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Complexity of the min-max and min-max regret assignment problems
Operations Research Letters
On the complexity of the robust spanning tree problem with interval data
Operations Research Letters
The robust spanning tree problem with interval data
Operations Research Letters
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
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
The complexity of bottleneck labeled graph problems
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
| Hi-index | 0.00 |
This paper investigates the complexity of the min-max and min-max regret versions of the s–t min cut and min cut problems. Even if the underlying problems are closely related and both polynomial, we show that the complexity of their min-max and min-max regret versions, for a constant number of scenarios, are quite contrasted since they are respectively strongly NP-hard and polynomial. Thus, we exhibit the first polynomial problem, s–t min cut, whose min-max (regret) versions are strongly NP-hard. Also, min cut is one of the few polynomial problems whose min-max (regret) versions remain polynomial. However, these versions become strongly NP-hard for a non constant number of scenarios. In the interval data case, min-max versions are trivially polynomial. Moreover, for min-max regret versions, we obtain the same contrasted result as for a constant number of scenarios: min-max regret s–t cut is strongly NP-hard whereas min-max regret cut is polynomial.