Constructing minimum-interference networks
From MaRDI portal
Publication:929744
DOI10.1016/j.comgeo.2007.06.004zbMath1138.90354OpenAlexW2142852908MaRDI QIDQ929744
Alexander Wolff, Joachim Gudmundsson, Marc Benkert, Herman J. Haverkort
Publication date: 18 June 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.06.004
connectivityspannerswell-separated pair decomposition\(d\)-hop networkinterference networksorder-\(j\) Voronoi diagramsending-link-based interference
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (5)
Minimizing interference in ad hoc networks with bounded communication radius ⋮ Exact algorithms to minimize interference in wireless sensor networks ⋮ A model to simplify 2D triangle meshes with irregular shapes ⋮ Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Networks ⋮ Exact formulations for the minimum interference problem ink-connectedad hocwireless networks
Cites Work
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Range searching with efficient hierarchical cuttings
- Approximate range searching
- Higher order Delaunay triangulations
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
- Geometric Spanner Networks
- An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Constructing minimum-interference networks
