A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On Tree-Constrained Matchings and Generalizations
[chapter]

2011
*
Lecture Notes in Computer Science
*

We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximum weight matching M between nodes of the two trees, such that none of the matched nodes is an ancestor of another matched node in either of the trees. This generalization of the classical bipartite matching problem appears, for example, in the computational analysis of live cell video data. We show that the problem is APX

doi:10.1007/978-3-642-22006-7_9
fatcat:exay2nca5rhpfif4jstbrl7s64