Robustness and Approximation for Universal Sequencing
Robustness and Approximation for Universal Sequencing
复制标题
通用测序的稳健性和近似
DOI:
10.1007/978-3-319-24971-1_13
复制
发表时间:
--
期刊:
影响因子:
--
通讯作者:
N. Megow.
中科院分区:
文献类型:
--
作者:
N. Megow.
We consider the problem of finding a permutation of jobs that minimizeson a single machine for some non-negative, non-decreasing global cost functionf. We are interested in universal solutions that perform well for all functionsfsimultaneously. We construct universal sequences that are within a factor of 4 of the optimal cost for anyf. Furthermore, we analyze the tradeoff between the robustness forallcost functions and the approximation of the well understood case oflinearcost functions.
DOI:
10.1137/110844210
发表时间:
2012-05
期刊:
SIAM J. Comput.
影响因子:
--
作者:
Julián Mestre;Nicole Megow
通讯作者:
Julián Mestre;Nicole Megow
DOI:
10.1007/978-3-642-39206-1_63
发表时间:
2012-11
期刊:
SIAM J. Discret. Math.
影响因子:
--
作者:
Nicole Megow;José Verschae
通讯作者:
Nicole Megow;José Verschae
DOI:
10.1145/2422436.2422490
发表时间:
--
期刊:
影响因子:
--
作者:
N. Megow;J. Mestre.
通讯作者:
J. Mestre.