极小极大(后悔)网络优化问题的可逼近性
On the approximability of minmax (regret) network optimization problems
摘要:
本文讨论了一些基本的多项式可解的确定性网络问题的极小极大(遗憾)形式。它表明,如果场景的数量是无界的,那么所考虑的问题是不可近似的$\log^{1-ε} K$内的任何$ε>0$,除非NP $\subseteq$ DTIME $(n^{\mathrm{poly} \log n})$,其中$K$是场景的数量。
英文摘要:
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-ε} K$ for any $ε>0$ unless NP $\subseteq$ DTIME$(n^{\mathrm{poly} \log n})$, where $K$ is the number of scenarios.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。