Geometric algorithms for a minimum cost assignment problem

Takeshi Tokuyama, Jun Nakano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

We consider the minimum cost A-assignment problem, which is equivalent to the minimum weight one-to-many matching problem in a complete bipartite graph Γ = (A,B), where A and B have n and k nodes respectively. Formulating the problem as a geometric problem, we give an O(kn + k3.5n0.5)-time randomized algorithm, which is better than existing O(kn2 + n2 log n)-time algorithm if k≤ n0.6.

Original languageEnglish
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherAssociation for Computing Machinery
Pages262-271
Number of pages10
ISBN (Print)0897914260
DOIs
Publication statusPublished - 1991 Jun 1
Externally publishedYes
Event7th Annual Symposium on Computational Geometry, SCG 1991 - North Conway, United States
Duration: 1991 Jun 101991 Jun 12

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Other

Other7th Annual Symposium on Computational Geometry, SCG 1991
CountryUnited States
CityNorth Conway
Period91/6/1091/6/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

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

Cite this