Critical relaxed stable matchings with two-sided ties
We consider the stable marriage problem in the presence of ties in preferences and critical
vertices. The input to our problem is a bipartite graph where and denote sets of vertices …
vertices. The input to our problem is a bipartite graph where and denote sets of vertices …
[PDF][PDF] Min-Cost Popular Matchings in a Hospitals/Residents Instance with Complete Preferences
T Kavitha, K Makino - hospitals, 2024 - tcs.tifr.res.in
We consider a matching problem in a hospitals/residents instance G, ie, a many-to-one
matching instance, where every vertex has a strict ranking of its neighbors and hospitals …
matching instance, where every vertex has a strict ranking of its neighbors and hospitals …
Perfect matchings and popularity in the many-to-many setting
T Kavitha, K Makino - arXiv preprint arXiv:2411.00384, 2024 - arxiv.org
We consider a matching problem in a bipartite graph $ G $ where every vertex has a
capacity and a strict preference order on its neighbors. Furthermore, there is a cost function …
capacity and a strict preference order on its neighbors. Furthermore, there is a cost function …
Many-To-Many Polygon Matching à La Jaccard
A Naumann, A Bonerath… - 32nd Annual European …, 2024 - drops.dagstuhl.de
Integration of spatial data is a major field of research. An important task of data integration is
finding correspondences between entities. Here, we focus on combining building footprint …
finding correspondences between entities. Here, we focus on combining building footprint …