Geometric algorithms for the minimum cost assignment problem

DOI10.1002/rsa.3240060403zbMath0839.68073OpenAlexW1989070206MaRDI QIDQ4845077

Takeshi Tokuyama, Jun Nakano

Publication date: 28 May 1996

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060403

zbMATH Keywords

assignment problemtime randomized algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Boolean functions (06E30)

Related Items (3)

Using combinatorial optimization in model-based trimmed clustering with cardinality constraints ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Approximation algorithms for min-sum \(p\)-clustering

Cites Work

• Unnamed Item
• Triangulating point sets in space
• Splitting a configuration in a simplex
• Expected time bounds for selection
• Improved Algorithms for Bipartite Network Flow
• Faster Scaling Algorithms for Network Problems
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Geometric algorithms for the minimum cost assignment problem