z-logo
open-access-imgOpen Access
Reduction of the asymptotic complexity of the assignment problem
Author(s) -
Egor Morozov,
В. А. Бартенев,
G. M. Rudakova,
O. V. Korchevskaya,
Е В Туева
Publication year - 2018
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/450/4/042011
Subject(s) - dijkstra's algorithm , bipartite graph , shortest path problem , reduction (mathematics) , mathematical optimization , computer science , class (philosophy) , computational complexity theory , graph , path (computing) , mathematics , theoretical computer science , algorithm , artificial intelligence , geometry , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here