9 search results - page 1 / 2 » Complexity of the Min-Max (Regret) Versions of Cut Problems |
ISAAC
2005
Springer
13 years 10 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...
COCOON
2006
Springer
13 years 9 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...
DISOPT
2008
13 years 5 months 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 ...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
DISOPT
2010
13 years 5 months 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...