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

非信号局部性下界 for 统治集

Sensitivity and Locality Lower Bounds via Low-Soundness Label Cover

Lund & Columbia(隆德大学与哥伦比亚大学);IAS(高等研究院);National Institute of Informatics(信息学国立研究所)

Noah Fleming, Max Hopkins, Yuichi Yoshida

AI总结:

研究非信号模型中统治集的局部性下界,证明O(logΔ)近似非信号分布需要Ω(logn/(logΔ·polyloglogΔ))的局部性,并推导出量子-LOCAL模型下的度无关下界。

摘要:

最小支配集是一个基本的局部覆盖问题和分布式计算中的核心任务。尽管已有广泛研究,但在经典LOCAL模型中,已知算法与下界之间仍存在显著差距。Chang和Li证明了一个常数因子近似所需的Ω(logn)局部性下界,而Kuhn-Moscibroda-Wattenhofer给出了超越logΔ近似算法的算法,并给出了一个较弱的下界,该下界大致与min{logΔ/loglogΔ,√(logn/loglogn)}成比例。不幸的是,这个下界对于小Δ来说较弱,且无法恢复Chang-Li的下界,留下核心问题:O(logΔ)近似是否需要Ω(logn)的局部性?此类下界是否能扩展到LOCAL模型?在本文中,我们通过非信号模型(严格包含LOCAL、量子-LOCAL和有限依赖性设置)迈出回答这些问题的重要一步。我们证明了每个O(logΔ)近似非信号分布对于支配集需要局部性Ω(logn/(logΔ·polyloglogΔ))。进一步,我们展示对于某些β∈(0,1),每个O(log^βΔ)近似非信号分布需要局部性Ω(logn/logΔ),结合KMW的下界,得出量子-LOCAL模型下O(log^βΔ)近似算法的度无关下界为Ω(√(logn/loglogn))。证明基于两个新的低声音量下界,一个通过Impagliazzo-Kabanets-Wigderson风格的并行重复与度降低,另一个来自Dinur-Harsha框架的敏感性保持重述,以及从label cover到set cover到dominating set的归约,以及Fleming和Yoshida的敏感性到局部性转移定理。

英文摘要:

We study the sensitivity of approximation algorithms, which measures how much their output distributions change under a single input edit. We show that, for Set Cover, Dominating Set, Min-Rep, and minimum unweighted directed 3-spanner, even a $\log^βn$ approximation requires sensitivity $n^{Ω(1)}$, for some absolute constant $β>0$ and all sufficiently large $n$. The lower bounds hold even for randomized algorithms with unrestricted computation. Here $n$ is the universe size for Set Cover and the number of vertices for the graph problems. On bounded-degree graphs, our sensitivity lower bounds imply logarithmic locality lower bounds in the randomized LOCAL model and its non-signaling generalization. For Dominating Set, fix $\varepsilon\in(0,1)$ and a sufficiently large constant maximum-degree bound $Δ$. A $(1+\varepsilon)\lnΔ$ approximation can be achieved with sensitivity and LOCAL round complexity independent of $n$. We show that improving the ratio to $(1-\varepsilon)\lnΔ$ requires sensitivity $n^{Ω_{\varepsilon,Δ}(1)}$, and hence locality $Ω_{\varepsilon,Δ}(\log n)$. For minimum unweighted directed 3-spanner, every constant approximation factor requires logarithmic locality, even on DAGs of constant maximum total degree. The key ingredient is a polynomial sensitivity lower bound for a variant of low-soundness Label Cover. Fleming and Yoshida established such a lower bound when the required fraction of satisfied constraints on satisfiable instances is close to one. We extend this to inverse-polylogarithmic fractions, enabling the reductions to the problems above. We adapt the Impagliazzo--Kabanets--Wigderson direct-product construction and Dinur--Harsha iterated composition to control the propagation of input edits, and design recovery procedures that are stable under changes to both the supplied labeling and the source instance.

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

↑