אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

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.