| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428719 | Information Processing Letters | 2009 | 5 Pages |
Abstract
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 log1−ϵK for any ϵ>0 unless NP⊆DTIME(npolylogn), where K is the number of scenarios.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
