Characterizations of Euclidean Distance Matrices with Applications<p>

   Henry Wolkowicz (with Abdo Alfakih)<br>
 Department of Combinatorics and Optimization<br>
 University of Waterloo<br>
 Waterloo, Ontario  N2L 3G1<br>
<p>

We present a characterization of those
Euclidean distance matrices $D$ which can be expressed
as $D= \lambda (E - C)$ for some nonnegative scalar $\lambda$ and some
correlation matrix $C$, where $E$ is the matrix of all ones.
This characterization is useful in designing algorithms for large sparse
problems.