The MST of symmetric disk graphs (in arbitrary metric spaces) is light

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Consider an n-point metric space M = (V,δ), and a transmission range assignment r: V → ℝ+ that maps each point v ∈ V to the disk of radius r(v) around it. The symmetric disk graph (henceforth, SDG) that corresponds to M and r is the undirected graph over V whose edge set includes an edge (u,v) if both r(u) and r(v) are no smaller than δ(u,v). SDGs are often used to model wireless communication networks. Abu-Affash, Aschner, Carmi and Katz (SWAT 2010, [1]) showed that for any n-point 2-dimensional Euclidean space M, the weight of the MST of every connected SDG for M is O(logn)·w(MST(M)), and that this bound is tight. However, the upper bound proof of [1] relies heavily on basic geometric properties of constant-dimensional Euclidean spaces, and does not extend to Euclidean spaces of super-constant dimension. A natural question that arises is whether this surprising upper bound of [1] can be generalized for wider families of metric spaces, such as high-dimensional Euclidean spaces. In this paper we generalize the upper bound of Abu-Affash et al. [1] for Euclidean spaces of any dimension. Furthermore, our upper bound extends to arbitrary metric spaces and, in particular, it applies to any of the normed spaces ℓp. Specifically, we demonstrate that for any n-point metric space M, the weight of the MST of every connected SDG for M is O(logn)·w(MST(M)).

Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings
Pages691-702
Number of pages12
DOIs
StatePublished - 2011
Externally publishedYes
Event12th International Symposium on Algorithms and Data Structures, WADS 2011 - New York, NY, United States
Duration: 15 Aug 201117 Aug 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6844 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Symposium on Algorithms and Data Structures, WADS 2011
Country/TerritoryUnited States
CityNew York, NY
Period15/08/1117/08/11

Fingerprint

Dive into the research topics of 'The MST of symmetric disk graphs (in arbitrary metric spaces) is light'. Together they form a unique fingerprint.

Cite this