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 ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
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...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...