Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm

11/03/2022
by   Fatemeh Rajabi-Alni, et al.
0

Given two sets A=a_1,a_2,...,a_s and b_1,b_2,...,b_t, a many-to-many matching with demands and capacities (MMDC) between A and B matches each element a_i in A to at least α_i and at most α'_i elements in B, and each element b_j in B to at least β_j and at most β'_j elements in A for all 1=<i<=s and 1=<j<=t. In this paper, we present an algorithm for finding a minimum-cost MMDC between A and B using the well-known Hungarian algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2019

A Fast and Efficient algorithm for Many-To-Many Matching of Points with Demands in One Dimension

Given two point sets S and T, we first study the many-to-many matching w...
research
11/29/2021

A new Sinkhorn algorithm with Deletion and Insertion operations

This technical report is devoted to the continuous estimation of an epsi...
research
02/25/2023

Generalization Bounds for Set-to-Set Matching with Negative Sampling

The problem of matching two sets of multiple elements, namely set-to-set...
research
02/20/2020

On Learning Sets of Symmetric Elements

Learning from unordered sets is a fundamental learning setup, which is a...
research
06/18/2020

The Only Undoable CRDTs are Counters

In comparing well-known CRDTs representing sets that can grow and shrink...
research
04/12/2020

Multiparty Selection

Given a sequence A of n numbers and an integer (target) parameter 1≤ i≤ ...
research
10/30/2014

Tasks that Require, or can Benefit from, Matching Blank Nodes

In various domains and cases, we observe the creation and usage of infor...

Please sign up or login with your details

Forgot password? Click here to reset