Finding large independent sets in line of sight networks

DOI10.1007/978-3-319-53007-9_29MaRDI QIDQ2971663zbMATH OpenOpenAlexFDO

Authors Pavan Sangha, Michele Zito

Publication date 7 April 2017

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-53007-9_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Wireless sensor networks as related to computer science (68M18)

Recommendations

• Independent sets in Line of Sight networks
• Independent Sets in Restricted Line of Sight Networks
• Dynamic programming optimization in line of sight networks
• Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
• Line-of-Sight Networks

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1518742 (Why is no real title available?)
• scientific article; zbMATH DE number 786469 (Why is no real title available?)
• Algorithms for drawing graphs: An annotated bibliography
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Connectivity for line-of-sight networks in higher dimensions
• Graph-Theoretic Concepts in Computer Science
• Graphs on surfaces
• Gridline graphs: A review in two dimensions and an extension to higher dimensions
• Line-of-Sight Networks
• 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
• On the efficiency of polynomial time approximation schemes
• Simple heuristics for unit disk graphs
• Unit disk graphs
• Universality considerations in VLSI circuits

Cited in

(7)

• Dynamic programming optimization in line of sight networks
• Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
• Line-of-sight networks
• Independent sets in Line of Sight networks
• Independent Sets in Restricted Line of Sight Networks
• Vertex-connectivity for node failure identification in Boolean network tomography
• Induced embeddings into Hamming graphs

This page was built for publication: Finding large independent sets in line of sight networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971663)