3-approximation hardness for Euclidean Bichromatic Closest Pair
Statement
Assuming the Strong Exponential Time Hypothesis (SETH), prove that for some constant , approximating the Bichromatic Closest Pair problem under the Euclidean metric within a factor of requires time .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.