Realizing Euclidean distance matrices by sphere intersection

Abstract : This paper presents the theoretical properties of an algorithm to find a realization of a (full) n × n Euclidean distance matrix in the smallest possible embedding dimension. Our algorithm performs linearly in n, and quadratically in the minimum embedding dimension, which is an improvement w.r.t. other algorithms.
Document type :
Journal articles
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02350274
Contributor : Leo Liberti <>
Submitted on : Wednesday, November 6, 2019 - 5:24:51 AM
Last modification on : Saturday, November 9, 2019 - 1:39:38 AM

File

dam18b.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jorge Alencar, Carlile Lavor, Leo Liberti. Realizing Euclidean distance matrices by sphere intersection. Discrete Applied Mathematics, Elsevier, 2019, 256, pp.5-10. ⟨10.1016/j.dam.2018.06.003⟩. ⟨hal-02350274⟩

Share

Metrics

Record views

7

Files downloads

15