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