Finding Large Independent Sets in Line of Sight Networks
type: Item
instance of: scholarly article
title: Finding Large Independent Sets in Line of Sight Networks
zbMATH Open document ID: 1436.68259
DOI: 10.1007/978-3-319-53007-9_29
author: Pavan Sangha
author: Michele Zito
published in: Algorithms and Discrete Applied Mathematics
publication date: 2017-04-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68M18
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6702499
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-319-53007-9 29
OpenAlex ID: W2583658936
cites work: Q4258216
cites work: On the efficiency of polynomial time approximation schemes
cites work: Unit disk graphs
cites work: Q5747389
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Q4507228
cites work: Line-of-Sight Networks
cites work: Q4198056
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
cites work: Simple heuristics for unit disk graphs
cites work: Graphs on surfaces
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Gridline graphs: A review in two dimensions and an extension to higher dimensions
cites work: Q4842952
cites work: Universality considerations in VLSI circuits
description: scientific article; zbMATH DE number 6702499