Geometric algorithms for the minimum cost assignment problem

Takeshi Tokuyama; Jun Nakano

doi:10.1002/rsa.3240060403

Geometric algorithms for the minimum cost assignment problem

Takeshi Tokuyama, Jun Nakano

情報学研究科・システム情報科学専攻

研究成果: Article › 査読

12 被引用数 (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 + k^2.5n^0.5 log^1.5 n) time randomized algorithm, which is better than the existing O(kn² + n² log n) time algorithm if n > k log k.

本文言語	English
ページ（範囲）	393-406
ページ数	14
ジャーナル	Random Structures & Algorithms
巻	6
号	4
DOI	https://doi.org/10.1002/rsa.3240060403
出版ステータス	Published - 1995 7

ASJC Scopus subject areas

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

文献へのアクセス

10.1002/rsa.3240060403

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

引用スタイル

@article{8cd7fd03f1ff484c8a5e89a3dacb77ce,

title = "Geometric algorithms for the minimum cost assignment problem",

abstract = "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.",

author = "Takeshi Tokuyama and Jun Nakano",

year = "1995",

month = jul,

doi = "10.1002/rsa.3240060403",

language = "English",

volume = "6",

pages = "393--406",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "4",

}

TY - JOUR

T1 - Geometric algorithms for the minimum cost assignment problem

AU - Tokuyama, Takeshi

AU - Nakano, Jun

PY - 1995/7

Y1 - 1995/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84990712132&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990712132&partnerID=8YFLogxK

U2 - 10.1002/rsa.3240060403

DO - 10.1002/rsa.3240060403

M3 - Article

AN - SCOPUS:84990712132

VL - 6

SP - 393

EP - 406

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 4

ER -