Paper Info
Title
On the approximability of minmax (regret) network optimization problems
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 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.
Year
DOI
Venue
2009
10.1016/j.ipl.2008.10.008
Information Processing Letters
Keywords
DocType
Volume
combinatorial optimization
Journal
109
Issue
ISSN
Citations 
5
0020-0190
20
PageRank 
References 
Authors
1.01
16
2
Name
Order
Citations
PageRank
Adam Kasperski135233.64
Paweł Zieliński227419.73