Sciweavers

DISOPT
2008

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

13 years 3 months ago
Complexity of the min-max (regret) versions of min cut problems
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and both polynomial, the complexity of their min-max and min-max regret versions, for a constant number of scenarios, is quite contrasted since they are respectively strongly NPhard and polynomial. However, for a non constant number of scenarios, these versions become strongly NP-hard for both problems. In the interval scenario 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 min s-t cut is strongly NP-hard whereas min-max regret min cut is polynomial.
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DISOPT
Authors Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Comments (0)