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

添加孤立点使某些在线算法最优

Adding Isolated Vertices Makes some Online Algorithms Optimal

Joan Boyar, Christian Kudahl

摘要:

观察到在线和离线算法之间的意外差异。自然的贪心算法被证明是最坏情况下在线最优的在线独立集和在线顶点覆盖的图与“足够”的孤立顶点,雀斑图。对于在线支配集,证明了贪心算法在至少有一个孤立顶点的图上是最坏情况在线最优的。这些算法通常不是在线最优的。这些贪心算法的在线最优性结果根据各种最坏情况下的性能指标(如竞争比)暗示了最优性。它还表明,尽管这种最坏情况下的最优性,有雀斑图的贪婪独立集算法是客观上不如另一种算法。证明了对于给定的图,确定在线独立数、在线顶点覆盖数和在线控制数中的任何一个都是NP-困难的。

英文摘要:

An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with 'enough' isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is shown to be worst case online optimal on graphs with at least one isolated vertex. These algorithms are not online optimal in general. The online optimality results for these greedy algorithms imply optimality according to various worst case performance measures, such as the competitive ratio. It is also shown that, despite this worst case optimality, there are Freckle graphs where the greedy independent set algorithm is objectively less good than another algorithm. It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.

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

↑