Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
17 views

Complexity of optimal cartesian matching

Question: what is known about the algorithmic aspects of optimally matching a set $\mathcal{P} = \prod\limits_{i=1}^n \left(1,\,\cdots,\,k_i\right)$ of grid-points to a set of $\prod\limits_{i=1}^...
Manfred Weis's user avatar
  • 13.2k