Elad Hazan, Shmuel Safra, Oded Schwartz. On the Hardness of Approximating k-Dimensional Matching. Electronic Colloquium on Computational Complexity (ECCC), 10(020), 2003. [doi]
@article{ECCC-TR03-020,
title = {On the Hardness of Approximating k-Dimensional Matching},
author = {Elad Hazan and Shmuel Safra and Oded Schwartz},
year = {2003},
url = {http://eccc.hpi-web.de/eccc-reports/2003/TR03-020/index.html},
researchr = {https://researchr.org/publication/ECCC-TR03-020},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {10},
number = {020},
}