you're reading...

Tree-constrained matching – – Julian Mestre

Dear all,

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:
http://sact.it.usyd.edu.au/sact-index.html#%5B%5Bseminar calendar]]
Or you can subscribe to this calendar using the following URL:



No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers

%d bloggers like this: