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

关于非均匀费用的树搜索问题

On the Tree Search Problem with Non-uniform Costs

Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomáš Valla

摘要:

在信息检索和有效的树状索引的背景下,以及在基于层次结构的知识表示中,已被认为是在偏序结构中的搜索。在本文中,我们专注于树型偏序,并考虑问题,确定一个最初未知的顶点在一棵树中问边查询:边查询$e$返回$T-e$的组件包含的顶点寻求,而招致一些已知的成本$c(e)$。非均匀代价的树搜索问题是:给定一棵树$T$,其中每条边都有一个相关的代价,构造一个策略,在最坏的情况下,最小化识别的总代价。对于度为3或直径为6的输入树,寻找保证最小可能成本的策略已经是NP完全问题。最知名的近似保证是[Cicalese et al. TCS 2012]的$O(\log n/\log \log \log n)$ -近似算法。我们从算法和计算复杂性度的角度改进了上述结果:我们提供了一种新的算法,该算法提供了最优策略的成本的$O(\frac{\log n}{\log \log n})$近似。此外,我们发现,即使输入树是一个蜘蛛,找到一个最佳策略是NP完全的,即,最多一个顶点的度数大于2。

英文摘要:

Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge representation. In this paper we focus on tree-like partial orders and consider the problem of identifying an initially unknown vertex in a tree by asking edge queries: an edge query $e$ returns the component of $T-e$ containing the vertex sought for, while incurring some known cost $c(e)$. The Tree Search Problem with Non-Uniform Cost is: given a tree $T$ where each edge has an associated cost, construct a strategy that minimizes the total cost of the identification in the worst case. Finding the strategy guaranteeing the minimum possible cost is an NP-complete problem already for input tree of degree 3 or diameter 6. The best known approximation guarantee is the $O(\log n/\log \log \log n)$-approximation algorithm of [Cicalese et al. TCS 2012]. We improve upon the above results both from the algorithmic and the computational complexity point of view: We provide a novel algorithm that provides an $O(\frac{\log n}{\log \log n})$-approximation of the cost of the optimal strategy. In addition, we show that finding an optimal strategy is NP-complete even when the input tree is a spider, i.e., at most one vertex has degree larger than 2.

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

↑