Abstract
We introduce the problem of finding a maximum weight matching in a graph such that the number of matched vertices lies in a prescribed interval and certain vertices will be matched. In the case of bipartite graphs, this generalizes the k-cardinality assignment problem which was recently studied by Dell'Amico and Martello (Discrete Appl. Math. 76 (1997) 103–121). Similarly defined a minimum weight constrained edge covering problem is shown to be NP-hard even for bipartite graphs. We present a simple polynomial transformations of such matching and simplified covering problems to classical unconstrained problems. In the case of bipartite graphs also min-cost flow formulations are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
