← 研踪 PaperTrailarXiv: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
摘要
Given a metric space a -well separated pair decomposition (WSPD) is a collection of `dumbbell' pairs of subsets , , where the distance between the two sets is at least times the diameter of each set and every pair of points in is covered by one such pair. It is known that for a weighted unit disk graph metric of points, there is a WSPD of size . But it is open whether this bound can be improved to . 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
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 09:17 · 最新观测版本
A Linear-Size Well-Separated Pair Decomposition for Unit Disk Graphs
Given a metric space a -well separated pair decomposition (WSPD) is a collection of `dumbbell' pairs of subsets , , where the distance between the two sets is at least times the diameter of each set and every pair of points in is covered by one such pair. It is known that for a weighted unit disk graph metric of points, there is a WSPD of size . But it is open whether this bound can be improved to . In this note, we answer this question affirmatively and provide an algorithm that yields a linear-size WSPD for unit disk graphs.
查看此版本解读 →查看此版本原文 ↗