Shmuel Safra

Research activity per year

If you made any changes in Pure these will be visible here soon.

Filter

2003
On the complexity of approximating k-dimensional matching
Hazan, E., Safra, S. & Schwartz, O., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Asora, S., Sahai, A., Jansen, K. & Rolim, J. D. P. (eds.). Springer Verlag, p. 83-97 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2764).
Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
Safra, S. & Schwartz, O., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). di Battista, G. & Zwick, U. (eds.). Springer Verlag, p. 446-458 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2832).
Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Research output