2 papers
cs.CG2025
Efficient Many-To-Many Matching of Points with Demands in One Dimension
Fatemeh Rajabi-Alni, Behrouz Minaei-Bidgoli
Given two point sets and , the minimum-cost many-to-many matching with demands (MMD) problem is the problem of finding a minimum-cost many-to-many matching between and $…
cs.DS2025
An time algorithm for the maximum-weight limited-capacity many-to-many matching
Fatemeh Rajabi-Alni, Behrouz Minaei-Bidgoli
Given an undirected bipartite graph , a many-to-many matching (MM) in matches each vertex in (resp. ) to at least one vertex in (resp. ). In…