Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,959,115 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.
2019
2019
Interference Management in NOMA-based Fog-Radio Access Networks via Joint Scheduling and Power Adaptation
Itsikiantsoa Randrianantenaina
,
Megumi Kaneko
,
H. Dahrouj
,
Hesham Elsawy
,
Mohamed-Slim Alouini
arXiv.org
2019
Corpus ID: 67855622
Non-Orthogonal Multiple Access (NOMA) and Fog Radio Access Networks (FRAN) are promising candidates within the 5G and beyond…
Expand
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
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
Review
2015
Review
2015
Linear approximation of Karnik-Mendel type reduction algorithm
Syed Moshfeq Salaken
,
A. Khosravi
,
S. Nahavandi
,
Dongrui Wu
IEEE International Conference on Fuzzy Systems
2015
Corpus ID: 32114580
Karnik-Mendel (KM) algorithm is the most used and researched type reduction (TR) algorithm in literature. This algorithm is…
Expand
2013
2013
Spectrum sharing optimization with QoS guarantee in cognitive radio networks
Saleem Aslam
,
Kyung-Geun Lee
Computers & electrical engineering
2013
Corpus ID: 2061596
2011
2011
Offline signature using Cross validation and Graph matching approach
D. Bhole
,
A. Vidhate
,
S. Velankar
2011
Corpus ID: 5192892
Compared to physiologically Base biometric system such as fingerprint, face, palm- vein and retina, behavioral based system such…
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
or Only Accept Required