Independent sets in Line of Sight networks
From MaRDI portal
Publication:2201775
DOI10.1016/j.dam.2019.03.029zbMath1448.05154OpenAlexW2942569330WikidataQ127965394 ScholiaQ127965394MaRDI QIDQ2201775
Publication date: 17 September 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.03.029
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- On the efficiency of polynomial time approximation schemes
- Approximation algorithms for intersection graphs
- Design and analysis of approximation algorithms
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Unit disk graphs
- Optimization, approximation, and complexity classes
- Algorithms for drawing graphs: An annotated bibliography
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- Dynamic programming optimization in 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
- Line-of-Sight Percolation
- Line-of-Sight Networks
- Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
- Elimination Graphs
- Universality considerations in VLSI circuits
- Simple heuristics for unit disk graphs
- Induced Embeddings into Hamming Graphs.
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Independent sets in Line of Sight networks
