Geometric algorithms for a minimum cost assignment problem

Takeshi Tokuyama, Jun Nakano

研究成果: Conference contribution

11 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings of the Annual Symposium on Computational Geometry
出版社Association for Computing Machinery
ページ262-271
ページ数10
ISBN(印刷版)0897914260
DOI
出版ステータスPublished - 1991 6 1
外部発表はい
イベント7th Annual Symposium on Computational Geometry, SCG 1991 - North Conway, United States
継続期間: 1991 6 101991 6 12

出版物シリーズ

名前Proceedings of the Annual Symposium on Computational Geometry

Other

Other7th Annual Symposium on Computational Geometry, SCG 1991
国/地域United States
CityNorth Conway
Period91/6/1091/6/12

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 幾何学とトポロジー
  • 計算数学

フィンガープリント

「Geometric algorithms for a minimum cost assignment problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル