%0 Journal Article
%A Diptesh Ghosh
%A Gerard Sierksma
%T On the complexity of determining tolerances
 for $\varepsilon $-optimal solutions to
 min-max combinatorial optimization problems
%J Applicationes Mathematicae
%D 2003
%P 305-313
%V 30
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.4064/am30-3-5/
%R 10.4064/am30-3-5
%G en
%F 10_4064_am30_3_5