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

最小积压问题

The Minimum Backlog Problem

Michael A. Bender, Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela

摘要:

本文研究了最小积压问题(MBP)。出现了这个在线问题,例如,在传感器网络的背景下。我们专注于MBP的两个主要变体。离散MBP是在图$G=(V,E)$上进行的2人博弈。玩家最初位于图的顶点。在每个时间步中,对手将总共一个单位的水倒入位于图的顶点上的杯子中,在杯子之间任意分配水。然后,玩家从她当前的顶点移动到相邻的顶点,并在该顶点清空杯子。玩家的目标是最小化积压,即,任何时候任何杯子里的最大水量。几何MBP是MBP的连续时间版本:杯子是二维平面上的点,对手以恒定的速度连续倒水,玩家以单位速度在平面上移动。同样,玩家的目标是最小化积压。我们发现,任何算法的MBP的竞争比有一个下界的$Ω(D)$,其中$D$是图的直径(离散MBP)或点集的直径(几何MBP)。因此,我们专注于为玩家确定一个策略,保证积压的绝对值的统一上限。对于积压的绝对值,$Ω(D)$的下限很小,Dietz和Sleator的摊销分析给出了$N$髋臼杯的$O(D\log N)$的上限。我们的主要结果是一个严格的上限的几何MBP:我们表明,有一个策略的球员,保证积压的$O(D)$,独立的杯子的数量。

英文摘要:

We study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP. The discrete MBP is a 2-person game played on a graph $G=(V,E)$. The player is initially located at a vertex of the graph. In each time step, the adversary pours a total of one unit of water into cups that are located on the vertices of the graph, arbitrarily distributing the water among the cups. The player then moves from her current vertex to an adjacent vertex and empties the cup at that vertex. The player's objective is to minimize the backlog, i.e., the maximum amount of water in any cup at any time. The geometric MBP is a continuous-time version of the MBP: the cups are points in the two-dimensional plane, the adversary pours water continuously at a constant rate, and the player moves in the plane with unit speed. Again, the player's objective is to minimize the backlog. We show that the competitive ratio of any algorithm for the MBP has a lower bound of $Ω(D)$, where $D$ is the diameter of the graph (for the discrete MBP) or the diameter of the point set (for the geometric MBP). Therefore we focus on determining a strategy for the player that guarantees a uniform upper bound on the absolute value of the backlog. For the absolute value of the backlog there is a trivial lower bound of $Ω(D)$, and the deamortization analysis of Dietz and Sleator gives an upper bound of $O(D\log N)$ for $N$ cups. Our main result is a tight upper bound for the geometric MBP: we show that there is a strategy for the player that guarantees a backlog of $O(D)$, independently of the number of cups.

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

↑