Universal Rigidity and Edge Sparsification for Sensor Network Localization
From MaRDI portal
(Redirected from Publication:3083321)
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
Cited in
(19)- Singularity degree of the positive semidefinite matrix completion problem
- Global registration of multiple point clouds using semidefinite programming
- 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
- Lower bounds on the number of realizations of rigid graphs
- Selected open problems in discrete geometry and optimization
- 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
- Low-distortion inference of latent similarities from a multiplex social network
- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
- Generically globally rigid graphs have generic universally rigid frameworks
- Mechanism creation in tensegrity structures by cellular morphogenesis
- 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
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
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)
