We consider the minimum‐cost λ‐assignment problem, which is equivalent to the minimum‐weight one‐to‐many matching problem on a complete bipartite graph Γ = (A, B), where A and B have n and k nodes (n ⩾ k), respectively. Formulating the problem geometrically, we given an O(kn + k2.5n0.5 log1.5 n) time randomized algorithm, which is better than the existing O(kn2 + n2 log n) time algorithm if n > k log k.
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics