Tomorrow’s speaker will be Julian Mestre.
We study a generalization of maximum weight bipartite matching, where
we are given in addition trees over each side of the bipartition and
we add the additional requirement that the matched vertices on each
side are not comparable under the ancestor-descendant relation. The
problem arises in the interpretation of live cell video data. We give
approximation algorithms and hardness for the problem.
Time and location: Friday 11am-12noon SIT room 124 (boardroom)
The SACT calendar is available here:
Or you can subscribe to this calendar using the following URL: