A note on order preserving matchings

A note on order preserving matchings

0.00 Avg rating—0 Votes
Article ID: iaor1989650
Country: Netherlands
Volume: 8
Start Page Number: 197
End Page Number: 200
Publication Date: Jun 1989
Journal: Operations Research Letters
Authors: , ,
Abstract:

The authors study order preserving injections or bipartite matchings from poset V1 to poset V2. When V1 is totally ordered, they give an efficient algorithm for the associated optimization problem and the convex hull of the corresponding characteristic vectors. If V2 is totally ordered and V1 is not, the problem is NP-complete.

Reviews

Required fields are marked *. Your email address will not be published.