On the approximability of minmax (regret) network optimization problems

Details On the approximability of minmax (regret) network optimization problems On the approximability of minmax (regret) network optimization problems

2008-04-02

arxiv.org/abs/0804.0396v3

Computer Science

Computational Complexity

Scientific paper

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-\epsilon} K$ for any $\epsilon>0$ unless NP $\subseteq$ DTIME$(n^{\mathrm{poly} \log n})$, where $K$ is the number of scenarios.

Affiliated with

Also associated with

No associations

Rating

On the approximability of minmax (regret) network optimization problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the approximability of minmax (regret) network optimization problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the approximability of minmax (regret) network optimization problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-390285