Geometric algorithms for the minimum cost assignment problem

Takeshi Tokuyama, Jun Nakano

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)393-406
Number of pages14
JournalRandom Structures & Algorithms
Issue number4
Publication statusPublished - 1995 Jul

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics


Dive into the research topics of 'Geometric algorithms for the minimum cost assignment problem'. Together they form a unique fingerprint.

Cite this