Finding Large Independent Sets in Line of Sight Networks

Sangha, P and Zito, M (2017) Finding Large Independent Sets in Line of Sight Networks. In: Algorithms and Discrete Applied Mathematics; Third International Conference CALDAM 2017, 2017-2-16 - 2017-2-18, Goa.

Text files.pdf - Author Accepted Manuscript Download (336kB)

Abstract

Line of Sight (LoS) networks provide a model of wireless communication which incorporates visibility constraints. Vertices of such networks can be embedded in finite d-dimensional grids of size n, and two vertices are adjacent if they share a line of sight and are at distance less than

Item Type:	Conference or Workshop Item (Unspecified)
Uncontrolled Keywords:	unit disk graph, constant factor approximation, base vertex, variable gadget, clause gadget
Depositing User:	Symplectic Admin
Date Deposited:	15 Feb 2017 11:20
Last Modified:	19 Jan 2023 07:19
DOI:	10.1007/978-3-319-53007-9_29
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3005661