Approximability of the robust representatives selection problem

In this paper new complexity and approximation results on the robust versions of the representatives selection problem, under the scenario uncertainty representation, are provided, which extend the results obtained in the recent papers by Dolgui and Kovalev (2012) and Deineko and Woeginger (2013). Namely, it is shown that if the number of scenarios is a part of input, then the min-max (regret) representatives selection problem is not approximable within a ratio of O ( log 1 - ? K ) for any ? > 0 , where K is the number of scenarios, unless the problems in NP have quasi-polynomial time algorithms. An approximation algorithm with an approximation ratio of O ( log K / log log K ) for the min-max version of the problem is also provided.

[1]  Adam Kasperski,et al.  On the approximability of minmax (regret) network optimization problems , 2008, Inf. Process. Lett..

[2]  Ola Svensson,et al.  Single machine scheduling with scenarios , 2013, Theor. Comput. Sci..

[3]  Benjamin Doerr.  Generating Randomized Roundings with Cardinality Constraints and Derandomizations , 2006, STACS.

[4]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[5]  RaghavanPrabhakar.  Probabilistic construction of deterministic algorithms: approximating packing integer programs , 1988 .

[6]  Benjamin Doerr.  Improved approximation algorithms for the Min-Max Selecting Items problem , 2013, Inf. Process. Lett..

[7]  A. Srinivasan.  Approximation algorithms via randomized rounding : a survey , 1999 .

[8]  Gerhard J. Woeginger,et al.  Complexity and in-approximability of a selection problem in robust optimization , 2013, 4OR.

[9]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[10]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[11]  Alexandre Dolgui,et al.  Min–max and min–max (relative) regret approaches to representatives selection problem , 2012, 4OR.

[12]  Daniel Vanderpooten,et al.  Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..

[13]  Phokion G. Kolaitis.  Hardness Of Approximations , 1996 .