Abstract
The Distance Geometry Problem (DGP) is an inverse problem. The corresponding “direct problem” is to compute some pairwise distances of a given set of points. Whereas the direct problem is obviously trivial (just carry out the computation), the inverse problem is generally difficult to solve.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
See the metric axiom (Axiom 3) in Appendix A.6.
- 2.
The symbol \(\sum \limits _{k\le K}\) stands for \(\sum \limits _{k=1}^K\).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Liberti, L., Lavor, C. (2017). The Distance Geometry Problem. In: Euclidean Distance Geometry. Springer Undergraduate Texts in Mathematics and Technology. Springer, Cham. https://doi.org/10.1007/978-3-319-60792-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-60792-4_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60791-7
Online ISBN: 978-3-319-60792-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)