arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.11153cs.DS
收藏

结构化集合系统中的随机最大跨度极小化

Stochastic Makespan Minimization in Structured Set Systems

Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen

摘要:

我们研究随机组合优化问题,其目标是最小化期望的最大负载(又名\ makespan)。在这个框架中,我们有一组$n$任务和$m$资源,其中每个任务$j$使用资源的某个子集。任务具有随机大小$X_j$,我们的目标是非自适应地选择$t$任务,以最小化所有资源上的预期最大负载,其中任何资源$i$上的负载是使用$i$的所有选定任务的总大小。例如,当资源是点而任务是线上的区间时,我们得到了一个$O(\log\log m)$ -近似算法。我们的技术也适用于任务和资源之间关系中具有某些几何结构的其他问题;例如,打包路径、矩形和“胖”对象。我们的方法使用了一个强大的LP松弛使用的累积生成函数的随机变量。我们还表明,这个LP有一个$Ω(\log^* m)$完整性的差距,即使是在一条线上选择间隔的问题,这里$\log^* m$是迭代对数函数。

英文摘要:

We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a.\ the makespan). In this framework, we have a set of $n$ tasks and $m$ resources, where each task $j$ uses some subset of the resources. Tasks have random sizes $X_j$, and our goal is to non-adaptively select $t$ tasks to minimize the expected maximum load over all resources, where the load on any resource $i$ is the total size of all selected tasks that use $i$. For example, when resources are points and tasks are intervals in a line, we obtain an $O(\log\log m)$-approximation algorithm. Our technique is also applicable to other problems with some geometric structure in the relation between tasks and resources; e.g., packing paths, rectangles, and "fat" objects. Our approach uses a strong LP relaxation using the cumulant generating functions of the random variables. We also show that this LP has an $Ω(\log^* m)$ integrality gap, even for the problem of selecting intervals on a line; here $\log^* m$ is the iterated logarithm function.

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

↑