On the Hardness of Approximating k-Dimensional Matching

Elad Hazan, Shmuel Safra, Oded Schwartz. On the Hardness of Approximating k-Dimensional Matching. Electronic Colloquium on Computational Complexity (ECCC), 10(020), 2003. [doi]

Abstract

Abstract is missing.