Closest Pair Problem

From Algorithm Wiki

Revision as of 10:13, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Closest Pair Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * 2-dimensional array representation * 2-dimensional space, $l_m$ (or $l_\infty$) norm * 2-dimensional space, Euclidean metric * k-dimensional space, $l_m$ (or $l_\infty$) norm")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Description

Currently no description in our database for the given family.

Problems Variations

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Family:Closest_Pair_Problem&oldid=43690"