Shay Solomon: Dynamic Maximum Matching and Related Problems

Thursday, May 7, 2015 - 4:00pm to 5:00pm
Location: 
32-G575
Speaker: 
Shay Solomon
Biography: 
Weizmann Institute

Graph matching is one of the most well-studied problems in combinatorial optimization, with applications ranging from scheduling and object recognition to numerical analysis and computational chemistry.

Nevertheless, until recently very little was unknown about this problem in real-life {dynamic networks}, which aim to model the constantly changing physical world. 

In the first part of the talk we will discuss our work on the dynamic maximum matching problem.

In the second part of the talk we will highlight some of our work on a few related problems in both centralized and distributed systems.