A General Approximation Method for Bicriteria Minimization Problems
A General Approximation Method for Bicriteria Minimization Problems
复制标题
双准则最小化问题的通用逼近方法
DOI:
10.1016/j.tcs.2017.07.003
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
David Willems
中科院分区:
文献类型:
--
作者:
Pascal Halffmann;Stefan Ruzika;Clemens Thielen;David Willems
We present a general technique for approximating bicriteria minimization problems with positive-valued, polynomially computable objective functions. Given 0< ϵ≤ 1 and a polynomial-time α-approximation algorithm for the corresponding weighted sum problem, we show how to obtain a bicriteria (α⋅(1+ 2 ϵ), α⋅(1+ 2 ϵ))-approximation algorithm for the budget-constrained problem whose running time is polynomial in the encoding length of the input and linear in 1 ϵ. Moreover, we show that our method can be extended to compute an (α⋅(1+ 2 ϵ), α⋅(1+ 2 ϵ))-approximate Pareto curve under the same assumptions. Our technique applies to many minimization problems to which most previous algorithms for computing approximate Pareto curves cannot be applied because the corresponding gap problem is NP-hard to solve. For maximization problems, however, we show that approximation results similar to the ones presented here for minimization problems are impossible to obtain in polynomial time unless P= NP.
登录
查看更多内容
DOI:
--
发表时间:
2010
期刊:
影响因子:
--
作者:
Christian Glaer;Christian Reitwiener;M. Witek
通讯作者:
M. Witek
DOI:
--
发表时间:
1992
期刊:
ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
Valerie King;S. Rao;R. Tarjan
通讯作者:
R. Tarjan
DOI:
--
发表时间:
2009
期刊:
Electron. Colloquium Comput. Complex.
影响因子:
--
作者:
Christian Glaßer;Christian Reitwießner;M. Witek
通讯作者:
M. Witek
DOI:
--
发表时间:
2010
期刊:
Electron. Colloquium Comput. Complex.
影响因子:
--
作者:
Christian Glaßer;Christian Reitwießner;Heinz Schmitz;M. Witek
通讯作者:
M. Witek
DOI:
--
发表时间:
2001
期刊:
影响因子:
--
作者:
M. Ziegelmann
通讯作者:
M. Ziegelmann