On the Complexity of Approximating k-Dimensional Matching

Elad Hazan, Shmuel Safra, Oded Schwartz. On the Complexity of Approximating k-Dimensional Matching. In Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai, editors, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approx. Volume 2764 of Lecture Notes in Computer Science, pages 83-97, Springer, 2003. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.