Universal Rigidity and Edge Sparsification for Sensor Network Localization
From MaRDI portal
Publication:3083321
DOI10.1137/090772009zbMATH Open1211.90166OpenAlexW2046598752MaRDI QIDQ3083321FDOQ3083321
Authors: Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye 
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090772009
Recommendations
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Semidefinite Programming for Sensor Network and Graph Localization
- Theory of semidefinite programming for sensor network localization
- Theory of semidefinite programming for sensor network localization
- Explicit sensor network localization using semidefinite representations and facial reductions
- Sensor Networks Localization: Extending Trilateration via Shadow Edges
- Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22)
Cited In (19)
- Low-Distortion Inference of Latent Similarities from a Multiplex Social Network
- Comparing SOS and SDP relaxations of sensor network localization
- New upper bounds for the number of embeddings of minimally rigid graphs
- The m-Bézout bound and distance geometry
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Iterative universal rigidity
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\)
- The Tropical Cayley--Menger Variety
- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
- Selected Open Problems in Discrete Geometry and Optimization
- Generically globally rigid graphs have generic universally rigid frameworks
- Global Registration of Multiple Point Clouds Using Semidefinite Programming
- Mechanism creation in tensegrity structures by cellular morphogenesis
- Singularity Degree of the Positive Semidefinite Matrix Completion Problem
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Geometric buildup algorithms for sensor network localization
- Lower Bounds on the Number of Realizations of Rigid Graphs
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
Uses Software
This page was built for publication: Universal Rigidity and Edge Sparsification for Sensor Network Localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083321)
