DISOPT
2008
14 years 15 days ago
2008
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 ...
DISOPT
2010
14 years 15 days ago
2010
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...
COCOON
2006
Springer
14 years 4 months ago
2006
Springer
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...
ISAAC
2005
Springer
14 years 6 months ago
2005
Springer
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...