Uniquely Localizable Networks with Few Anchors | SpringerLink

In the network localization problem the locations of some nodes (called anchors) as well as the distances between some pairs of nodes are known, and the goal is to determine the location of all nodes. The localization problem is said to be solvable (or uniquely...

Abstract In the network localization problem the locations of some nodes (called anchors) as well as the distances between some pairs of nodes are known, and the goal is to determine the location of all nodes. The localization problem is said to be solvable (or uniquely localizable) if there is a unique set of locations consistent with the given data. Recent results from graph rigidity theory made it possible to characterize the solvability of the localization problem in two dimensions. In this paper we address the following related optimization problem: given the set of known distances in the

related reading

• Globally Rigid Augmentation of Minimally Rigid Graphs in $$\mathbb {R}^2$$ | Springer Nature Linklink.springer.com
• Your Transformer is Secretly an EOT Solver | Elements of a Vector Spaceelonlit.com
• The Local Learning Coefficient: A Singularity-Aware Complexity Measurearxiv.org
• unit-distance-cot.pdfcdn.openai.com
• arxiv.org/pdf/2101.09515arxiv.org
• unit-distance-remarks.pdfcdn.openai.com
• unit-distance-proof.pdfcdn.openai.com
• [2309.10122] Graph Threadingarxiv.org
• prox_algs.pdfweb.stanford.edu
• 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
• [2608.00140] Discrepancy Theory: An Algorithmic and Geometric Perspectivearxiv.org
• GraphTheoreticProperties.pdfcs.rice.edu