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

带建议的加权在线问题

Weighted Online Problems with Advice

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen

摘要:

最近,第一个在线复杂性类AOC被引入。这个类包含许多在线问题,每个请求必须被接受或拒绝,目标是最小化或最大化接受的请求的数量,同时保持一个可行的解决方案。所有AOC完备问题(包括独立集、顶点覆盖、支配集和集合覆盖)本质上具有相同的建议复杂度。在本文中,我们研究了AOC中问题的加权版本,即,每个请求都有一个权重,目的是最小化或最大化所接受请求的总权重。与未加权的版本相比,我们表明,在完整的最小化和最大化问题的建议复杂性有显着差异。我们还表明,我们的算法技术处理加权请求可以扩展到工作的非完整AOC问题,如最大匹配(给出更好的结果比一般AOC结果),甚至非AOC问题,如调度。

英文摘要:

Recently, the first online complexity class, AOC, was introduced. The class consists of many online problems where each request must be either accepted or rejected, and the aim is to either minimize or maximize the number of accepted requests, while maintaining a feasible solution. All AOC-complete problems (including Independent Set, Vertex Cover, Dominating Set, and Set Cover) have essentially the same advice complexity. In this paper, we study weighted versions of problems in AOC, i.e., each request comes with a weight and the aim is to either minimize or maximize the total weight of the accepted requests. In contrast to the unweighted versions, we show that there is a significant difference in the advice complexity of complete minimization and maximization problems. We also show that our algorithmic techniques for dealing with weighted requests can be extended to work for non-complete AOC problems such as maximum matching (giving better results than what follow from the general AOC results) and even non-AOC problems such as scheduling.

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

↑