Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,668,870 papers from all fields of science
Search
Sign In
Create Free Account
Hungarian algorithm
Known as:
KM algorithm
, Kuhn-Munkres algorithm
, Munkres' assignment algorithm
Expand
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Assignment problem
Auction algorithm
Breadth-first search
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A novel hybrid K-means and artificial bee colony algorithm approach for data clustering
Ajit Kumar
,
Dharmender Kumar
,
S. Jarial
2018
Corpus ID: 34546686
Article history: Received September 16, 2016 Received in revised format: October22, 2016 Accepted April15, 2017 Available online…
Expand
2017
2017
Slotting Optimization of Warehousing System Based on the Hungarian Method
Yuzhen Hu
,
Song Zhang
,
Xiaojuan Jia
,
Jiajia Chen
2017
Corpus ID: 62965070
This paper studies the problem of storage space optimization system based on different demand frequencies and different demand…
Expand
2015
2015
Cluster, Allocate, Cover: An Efficient Approach for Multi-robot Coverage
A. Gautam
,
Krishna Murthy Jatavallabhula
,
Gourav Kumar
,
S. P. Ram
,
Bhargav Jha
,
Sudeept Mohan
IEEE International Conference on Systems, Man and…
2015
Corpus ID: 2927714
This article presents an algorithm for online multirobot coverage that proceeds with minimal knowledge of the already explored…
Expand
2015
2015
Extending Laplacian sparse coding by the incorporation of the image spatial context
M. Mejdoub
,
Mouna Dammak
,
C. Amar
Neurocomputing
2015
Corpus ID: 43510285
2013
2013
Spectrum sharing optimization with QoS guarantee in cognitive radio networks
Saleem Aslam
,
Kyung-Geun Lee
Computers & electrical engineering
2013
Corpus ID: 2061596
2013
2013
An Improved KM Algorithm for Computing Structural Index of DAE System
Yan Zeng
,
Xuesong Wu
,
Jianwen Cao
12th International Symposium on Distributed…
2013
Corpus ID: 16473758
This paper proposes an improved KM algorithm to computing the structural index of linear time-invariant Differential Algebraic…
Expand
2010
2010
Centroid of a general type-2 fuzzy set computed by means of the centroid-flow algorithm
Daoyuan Zhai
,
J. Mendel
International Conference on Fuzzy Systems
2010
Corpus ID: 18378004
The centroid of a general type-2 fuzzy set (T2 FS) Ã can be obtained by taking the union of the centroids of all the α-planes…
Expand
2010
2010
Directional Relay with Spatial Time Slot Scheduling for mmWave WPAN Systems
Z. Lan
,
Junyi Wang
,
+5 authors
S. Kato
IEEE Vehicular Technology Conference
2010
Corpus ID: 7158341
In this paper, we propose a spacial time slot scheduling algorithm for relay operation to improve the throughput performance of…
Expand
1998
1998
AUTOMATED PAIR-WISE COMPARISONS OF MICROBIAL GENOMES
A. Bansal
,
P. Bork
,
Peter James Stuckey
1998
Corpus ID: 8242488
In this paper, we describe a framework for an automated pair-wise comparison of complete microbial 2 genomes to derive putative…
Expand
1995
1995
Iterative histogram modification of gray images
P. Bhattacharya
,
Y. Yan
IEEE Transactions on Systems, Man and Cybernetics
1995
Corpus ID: 7434100
We develop an iterated histogram modification algorithm for enhancing gray images. The modified image has very few gray levels…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE