Geometric algorithms for a minimum cost assignment problem

Takeshi Tokuyama; Jun Nakano

doi:10.1145/109648.109678

Geometric algorithms for a minimum cost assignment problem

Takeshi Tokuyama, Jun Nakano

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

12 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 + k^3.5n^0.5)-time randomized algorithm, which is better than existing O(kn² + n² log n)-time algorithm if k≤ n^0.6.

Original language	English
Title of host publication	Proceedings of the Annual Symposium on Computational Geometry
Publisher	Association for Computing Machinery
Pages	262-271
Number of pages	10
ISBN (Print)	0897914260
DOIs	https://doi.org/10.1145/109648.109678
Publication status	Published - 1991 Jun 1
Externally published	Yes
Event	7th Annual Symposium on Computational Geometry, SCG 1991 - North Conway, United States Duration: 1991 Jun 10 → 1991 Jun 12

Publication series

Name	Proceedings of the Annual Symposium on Computational Geometry

Other

Other	7th Annual Symposium on Computational Geometry, SCG 1991
Country/Territory	United States
City	North Conway
Period	91/6/10 → 91/6/12

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Access to Document

10.1145/109648.109678

Cite this

Tokuyama, T & Nakano, J 1991, Geometric algorithms for a minimum cost assignment problem. in Proceedings of the Annual Symposium on Computational Geometry. Proceedings of the Annual Symposium on Computational Geometry, Association for Computing Machinery, pp. 262-271, 7th Annual Symposium on Computational Geometry, SCG 1991, North Conway, United States, 91/6/10. https://doi.org/10.1145/109648.109678

@inproceedings{47895f3f88a34f37a332fd2eba33f62f,

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

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

author = "Takeshi Tokuyama and Jun Nakano",

year = "1991",

month = jun,

day = "1",

doi = "10.1145/109648.109678",

language = "English",

isbn = "0897914260",

series = "Proceedings of the Annual Symposium on Computational Geometry",

publisher = "Association for Computing Machinery",

pages = "262--271",

booktitle = "Proceedings of the Annual Symposium on Computational Geometry",

note = "7th Annual Symposium on Computational Geometry, SCG 1991 ; Conference date: 10-06-1991 Through 12-06-1991",

}

TY - GEN

T1 - Geometric algorithms for a minimum cost assignment problem

AU - Tokuyama, Takeshi

AU - Nakano, Jun

PY - 1991/6/1

Y1 - 1991/6/1

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

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

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

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

U2 - 10.1145/109648.109678

DO - 10.1145/109648.109678

M3 - Conference contribution

AN - SCOPUS:77953307102

SN - 0897914260

T3 - Proceedings of the Annual Symposium on Computational Geometry

SP - 262

EP - 271

BT - Proceedings of the Annual Symposium on Computational Geometry

PB - Association for Computing Machinery

T2 - 7th Annual Symposium on Computational Geometry, SCG 1991

Y2 - 10 June 1991 through 12 June 1991

ER -

Geometric algorithms for a minimum cost assignment problem

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this