Heuristic initialization for bipartite matching problems
DOI10.1145/1671970.1712656zbMath1284.68525OpenAlexW2061664364MaRDI QIDQ5406225
Johannes Langguth, Peter Sanders, Fredrik Manne
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1671970.1712656
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
This page was built for publication: Heuristic initialization for bipartite matching problems