A new algorithm for Many to Many Matching with Demands and Capacities
Abstract
Let A=a1,a2,...,as and b1,b2,...,bt with s+r=n, the many to many point matching with demands and capacities matches each point ai in A to at least alphai and at most alphai points in B, and each point bj in B to at least betaj and at most betaj points in A for all 1 <= i <= s and 1 <= j <= t. In this paper, we present an O(n4) time and O(n) space algorithm for this problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.