跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22049 · v1

A Linear-Size Well-Separated Pair Decomposition for Unit Disk Graphs

首次提交 2026-11-17 09:17
版本更新 2026-11-17 09:17
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

Given a metric space (X,d)(X, d) a cc-well separated pair decomposition (WSPD) is a collection of `dumbbell' pairs of subsets (A,B)(A, B), A,B⊆XA, B\subseteq X, where the distance between the two sets is at least cc times the diameter of each set and every pair of points in XX is covered by one such pair. It is known that for a weighted unit disk graph metric of nn points, there is a WSPD of size O(nlog⁡n)O(n\log n). But it is open whether this bound can be improved to O(n)O(n). In this note, we answer this question affirmatively and provide an algorithm that yields a linear-size WSPD for unit disk graphs.

作者备注:8 pages, 1 figure

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 09:17 · 最新观测版本

A Linear-Size Well-Separated Pair Decomposition for Unit Disk Graphs

Given a metric space (X,d)(X, d) a cc-well separated pair decomposition (WSPD) is a collection of `dumbbell' pairs of subsets (A,B)(A, B), A,B⊆XA, B\subseteq X, where the distance between the two sets is at least cc times the diameter of each set and every pair of points in XX is covered by one such pair. It is known that for a weighted unit disk graph metric of nn points, there is a WSPD of size O(nlog⁡n)O(n\log n). But it is open whether this bound can be improved to O(n)O(n). In this note, we answer this question affirmatively and provide an algorithm that yields a linear-size WSPD for unit disk graphs.

查看此版本解读 →查看此版本原文 ↗