Realizing Euclidean distance matrices by sphere intersection

Jorge Alencar; Carlile Lavor; Leo Liberti

doi:10.1016/j.dam.2018.06.003

Realizing Euclidean distance matrices by sphere intersection

Jorge Alencar
, Carlile Lavor
, Leo Liberti

Instituto Federal de Educação, Ciência e Tecnologia do Sul de Minas Gerais - IFSULDEMINAS
University of Campinas (UNICAMP)

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

Résumé

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.

langue originale	Anglais
Pages (de - à)	5-10
Nombre de pages	6
journal	Discrete Applied Mathematics
Volume	256
Les DOIs	https://doi.org/10.1016/j.dam.2018.06.003
état	Publié - 15 mars 2019

Accès au document

10.1016/j.dam.2018.06.003

Contient cette citation

@article{a9a18504ee864ef78c0a98194d6d778d,

title = "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.",

keywords = "Distance geometry, Embedding dimension, Euclidean distance matrix, Sphere intersection",

author = "Jorge Alencar and Carlile Lavor and Leo Liberti",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2019",

month = mar,

day = "15",

doi = "10.1016/j.dam.2018.06.003",

language = "English",

volume = "256",

pages = "5--10",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

}

TY - JOUR

T1 - Realizing Euclidean distance matrices by sphere intersection

AU - Alencar, Jorge

AU - Lavor, Carlile

AU - Liberti, Leo

PY - 2019/3/15

Y1 - 2019/3/15

N2 - 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.

AB - 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.

KW - Distance geometry

KW - Embedding dimension

KW - Euclidean distance matrix

KW - Sphere intersection

U2 - 10.1016/j.dam.2018.06.003

DO - 10.1016/j.dam.2018.06.003

M3 - Article

AN - SCOPUS:85049969195

SN - 0166-218X

VL - 256

SP - 5

EP - 10

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Realizing Euclidean distance matrices by sphere intersection

Résumé

Accès au document

Empreinte digitale

Contient cette citation