On the approximability of minmax (regret) network optimization problems

@article{Kasperski2009OnTA,
  title={On the approximability of minmax (regret) network optimization problems},
  author={Adam Kasperski and Pawel Zielinski},
  journal={Inf. Process. Lett.},
  year={2009},
  volume={109},
  pages={262-266}
}
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 K for any ǫ > 0 unless NP ⊆ DTIME(n log ), where K is the number of scenarios. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Similar Papers

Loading similar papers…