1. The Hungarian method for the assignment problem;Kuhn;Naval Research Logistics Quarterly,1955
2. L. Ramshaw, R. E. Tarjan, On minimum-cost assignments in unbalanced bipartite graphs, HP Labs, Palo Alto, CA, USA, Tech. Rep. HPL-2012-40R1.
3. Linear-time approximation for maximum weight matching;Duan;Journal of the ACM (JACM),2014
4. Shortest path discovery problems: A framework, algorithms and experimental results;Szepesvári,2004
5. Optimal path discovery problem with homogeneous knowledge;Caro;Theory Comput. Syst.,2020