Universal Rigidity and Edge Sparsification for Sensor Network Localization
From MaRDI portal
Publication:3083321
DOI10.1137/090772009zbMath1211.90166OpenAlexW2046598752MaRDI QIDQ3083321
Anthony Man-Cho So, Zhisu Zhu, 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
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The m-Bézout bound and distance geometry ⋮ Mechanism creation in tensegrity structures by cellular morphogenesis ⋮ New upper bounds for the number of embeddings of minimally rigid graphs ⋮ Generically globally rigid graphs have generic universally rigid frameworks ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ Lower Bounds on the Number of Realizations of Rigid Graphs ⋮ On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\) ⋮ Geometric buildup algorithms for sensor network localization ⋮ On the number of realizations of certain Henneberg graphs arising in protein conformation ⋮ Comparing SOS and SDP relaxations of sensor network localization ⋮ Singularity Degree of the Positive Semidefinite Matrix Completion Problem ⋮ On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs ⋮ The Tropical Cayley--Menger Variety ⋮ Selected Open Problems in Discrete Geometry and Optimization ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network ⋮ Iterative universal rigidity
Uses Software
