Embedding into l2∞ is easy embedding into l2∞ is NP-complete

We give a new randomized algorithm for enumerating all possible embeddings of a metric space (i.e., the distances between every pair within a set of <i>n</i> points) into <i>R</i><sup>2</sup> Cartesian space preserving their <i>l</i><inf>∞</inf> (or <i>l</i><inf>1</inf>) metric distances. Our expected time is O(<i>n</i><sup>2</sup> log<sup>3</sup> <i>n</i… CONTINUE READING