Stochastic Proximity Embedding: A Simple, Fast and Scalable Algorithm for Solving the Distance Geometry Problem

Dimitris K. Agrafiotis, Deepak Bandyopadhyay, Eric Yang. Stochastic Proximity Embedding: A Simple, Fast and Scalable Algorithm for Solving the Distance Geometry Problem. In Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan, editors, Distance Geometry: Theory, Methods, and Applications. pages 291-311, Springer, 2013. [doi]

@incollection{AgrafiotisBY13,
  title = {Stochastic Proximity Embedding: A Simple, Fast and Scalable Algorithm for Solving the Distance Geometry Problem},
  author = {Dimitris K. Agrafiotis and Deepak Bandyopadhyay and Eric Yang},
  year = {2013},
  doi = {10.1007/978-1-4614-5128-0_14},
  url = {https://doi.org/10.1007/978-1-4614-5128-0_14},
  researchr = {https://researchr.org/publication/AgrafiotisBY13},
  cites = {0},
  citedby = {0},
  pages = {291-311},
  booktitle = {Distance Geometry: Theory, Methods, and Applications},
  editor = {Antonio Mucherino and Carlile Lavor and Leo Liberti and Nelson Maculan},
  publisher = {Springer},
  isbn = {978-1-4614-5127-3},
}