Skip to main content

All Questions

Filter by
Sorted by
Tagged with
9 votes
1 answer
523 views

Choosing $K$ "centers" from the space of permutations

Let $\Pi$ denote the space of all permutations of $\{1,\dots,n\}$, and let $d(\cdot,\cdot)$ be a metric on $\Pi$. Suppose I am given a large integer $K$ and I have to select $K$ permutations $\pi_1,\...
Tom Solberg's user avatar
  • 4,049
7 votes
1 answer
318 views

Finding a short path using $(0.99n)!$ permutations

Suppose I have $n$ points $x_1,\dots,x_n$ that are all independent uniform samples in the unit square, and I'd like to find a short path (in terms of Euclidean length) that touches all of them (a ...
Tom Solberg's user avatar
  • 4,049
6 votes
3 answers
1k views

How can I embed an N-points metric space to a hypercube with low distortion?

I have a N-point metric space defined by the pairwise distance matrix. I want to encode these N points with binary strings, i.e. each point will be mapped to a vertex in a hypercube. The lengths of ...
pacificmoth's user avatar
2 votes
0 answers
131 views

Optimal way to group points in the plane into clusters

Consider a strictly decreasing sequence $d = (d_k)_{k\ge 1}$ of distances in $(0,1)$. Given a constant $C>2$, we say that $d$ has the $C$-grouping property if any finite non-empty subset $S$ (of ...
Mohan Swaminathan's user avatar