A Simple Yao-Yao-Based Spanner of Bounded Degree

Simple item page
dc.creatorDamian, Mirela
dc.date2008-02-29
dc.date2008-04-04
dc.date.accessioned2026-07-07T09:30:02Z
dc.date.available2026-07-07T09:30:02Z
dc.descriptionIt is a standing open question to decide whether the Yao-Yao structure for unit disk graphs (UDGs) is a length spanner of not. This question is highly relevant to the topology control problem for wireless ad hoc networks. In this paper we make progress towards resolving this question by showing that the Yao-Yao structure is a length spanner for UDGs of bounded aspect ratio. We also propose a new local algorithm, called Yao-Sparse-Sink, based on the Yao-Sink method introduced by Li, Wan, Wang and Frieder, that computes a (1+e)-spanner of bounded degree for a given UDG and for given e > 0. The Yao-Sparse-Sink method enables an efficient local computation of sparse sink trees. Finally, we show that all these structures for UDGs -- Yao, Yao-Yao, Yao-Sink and Yao-Sparse-Sink -- have arbitrarily large weight.
dc.description7 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/0802.4325
dc.identifierhttp://arxiv.org/abs/0802.4325
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158005
dc.subjectComputational Geometry
dc.subjectData Structures and Algorithms
dc.subjectC.2.1; F.2.2
dc.titleA Simple Yao-Yao-Based Spanner of Bounded Degree
dc.typetext

Files

Collections

arXiv