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

几何求交图的ETH紧算法:现在在多项式空间中

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh

摘要:

De Berg等人在[SICOMP 2020]中给出了一个算法框架,用于几何图上的次指数算法,具有紧(高达ETH)运行时间。该框架基于加权树宽图上的动态规划,从而产生使用超多项式空间的算法。我们引入了加权树深度的概念,并使用它来改进de Berg等人的框架。在几何图上获得多项式空间(运行时间紧)。因此,我们证明了,对于任何固定的尺寸$d \ge 2$上的相交图的类似大小的脂肪对象的许多著名的图形问题,包括独立集,$r$ -支配集恒定$r$,循环覆盖,哈密尔顿循环,哈密尔顿路径,斯坦纳树,连通顶点覆盖,反馈顶点集,和(连接)奇循环translation是可解的时间$2^{O(n^{1-1/d})}$和多项式空间内。

英文摘要:

De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dynamic programming on graphs of weighted treewidth resulting in algorithms that use super-polynomial space. We introduce the notion of weighted treedepth and use it to refine the framework of de Berg et al. for obtaining polynomial space (with tight running times) on geometric graphs. As a result, we prove that for any fixed dimension $d \ge 2$ on intersection graphs of similarly-sized fat objects many well-known graph problems including Independent Set, $r$-Dominating Set for constant $r$, Cycle Cover, Hamiltonian Cycle, Hamiltonian Path, Steiner Tree, Connected Vertex Cover, Feedback Vertex Set, and (Connected) Odd Cycle Transversal are solvable in time $2^{O(n^{1-1/d})}$ and within polynomial space.

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

↑