arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.5445cs.DS
收藏

多阶段鲁棒优化的节俭算法

Thrifty Algorithms for Multistage Robust Optimization

Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani

摘要:

我们考虑一类多阶段的鲁棒覆盖问题,在每个阶段的问题实例中,额外的信息被揭示,但采取行动的成本增加。决策者面临的困境是,是等待更多的信息并冒通货膨胀的风险,还是及早采取行动以对冲成本上升的风险。我们研究“k-鲁棒”不确定性模型:在每个阶段i = 0,1,.,T时,该算法被示出为完全包含要覆盖的最终需求的大小为k_i的某个子集;这里k_1 > k_2 >.> k_T,其确保随时间增加的信息。目标是尽量减少在最坏情况下可能出现的一系列启示所产生的成本。对于多阶段k-鲁棒集覆盖问题,我们给出了一个O(log m + log n)-近似算法,即使在T=2阶段,近似难度也接近Ω(log n + log m/loglog m).此外,我们的算法有一个有用的“节俭”属性:它只在两个阶段采取行动。我们展示了类似的节俭算法的多阶段k-鲁棒Steiner树,Steiner森林,和最小割。对于这些问题,我们的近似保证是O(min{T,log n,log L_{max}),其中L_{max}是所有阶段的最大膨胀。我们猜想,这些问题也承认O(1)-近似节俭算法。

英文摘要:

We consider a class of multi-stage robust covering problems, where additional information is revealed about the problem instance in each stage, but the cost of taking actions increases. The dilemma for the decision-maker is whether to wait for additional information and risk the inflation, or to take early actions to hedge against rising costs. We study the "k-robust" uncertainty model: in each stage i = 0, 1,...,T, the algorithm is shown some subset of size k_i that completely contains the eventual demands to be covered; here k_1 > k_2 >...> k_T which ensures increasing information over time. The goal is to minimize the cost incurred in the worst-case possible sequence of revelations. For the multistage k-robust set cover problem, we give an O(log m + log n)-approximation algorithm, nearly matching the Ω(log n + log m/loglog m) hardness of approximation even for T=2 stages. Moreover, our algorithm has a useful "thrifty" property: it takes actions on just two stages. We show similar thrifty algorithms for multi-stage k-robust Steiner tree, Steiner forest, and minimum-cut. For these problems our approximation guarantees are O(min{T, log n, log L_{max}), where L_{max} is the maximum inflation over all the stages. We conjecture that these problems also admit O(1)-approximate thrifty algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑