25 search results - page 1 / 5 » Improved Algorithms for the Minmax Regret 1-Median Problem |
COCOON
2006
Springer
14 years 2 months ago
2006
Springer
ISAAC
2005
Springer
14 years 4 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...
ESA
2005
Springer
14 years 4 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 ...
ORL
2008
13 years 10 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
SIGMOD
2012
ACM
12 years 1 months ago
2012
ACM
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...