Generalizations Of The Popular Matching Problem
Matching problems arise in several real-world scenarios like assigning posts to applicants, houses to trainees and room-mates to one another. In this thesis we consider the bipartite matching problem where one side of the bipartition specifies preferences over the other side. That is, we are given...
Main Author: | Nasre, Meghana |
---|---|
Other Authors: | Telikepalli, Kavitha |
Language: | en_US |
Published: |
2013
|
Subjects: | |
Online Access: | http://etd.iisc.ernet.in/handle/2005/2095 http://etd.ncsi.iisc.ernet.in/abstracts/2696/G24924-Abs.pdf |
Similar Items
-
PRACTICAL APPLICATION OF MATCHING ALGORITHMS IN CASE OF A TASK ALLOCATION PROBLEM
by: Péter Szikora
Published: (2015-04-01) -
An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
by: Shibsankar Das
Published: (2020-08-01) -
Maximum Semi-Matching Problem in Bipartite Graphs
by: Katrenič Ján, et al.
Published: (2013-07-01) -
A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings
by: Lu, H., et al.
Published: (2022) -
Matching Extendabilities of <i>G</i> = <i>C<sub>m</sub></i> ∨ <i>P<sub>n</sub></i>
by: Zhi-hao Hui, et al.
Published: (2019-10-01)