Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Interval data minmax regret network optimization problems
Discrete Applied Mathematics
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating min-max (regret) versions of some polynomial problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Complexity of the min-max (regret) versions of cut problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Operations Research Letters
Complexity of the min-max and min-max regret assignment problems
Operations Research Letters
On the complexity of the robust spanning tree problem with interval data
Operations Research Letters
On the approximability of robust spanning tree problems
Theoretical Computer Science
| Hi-index | 0.89 |
In this paper the minmax (regret) versions of some basic polynomially solvable deterministic network problems are discussed. It is shown that if the number of scenarios is unbounded, then the problems under consideration are not approximable within log^1^-^@eK for any @e0 unless NP@?DTIME(n^p^o^l^y^l^o^g^n), where K is the number of scenarios.