Yuval Efron, M.Sc. Thesis Seminar
Wednesday, 17.6.2020, 11:30
Zoom Lecture: https://technion.zoom.us/j/96006478037
Advisor: Prof. Keren Censor-Hillel
Finding exact solutions to many fundamental optimization and distance computation problems is known to be a hard task in the distributed CONGEST model of computation.
A natural relaxation then is to look for approximate solutions.
In this talk, I will discuss some of the research I did during my M.Sc. studies that concerns the trade-off between approximation ratio and round complexity for central optimization and distance computation problems.