The problem of finding a maximum cardinality matching in a d-partite, d-uniform hypergraph is an important problem in combinatorial optimization and has been theoretically analyzed. We first generalize some graph matching heuristics for this problem. We then propose a novel heuristic based on tensor scaling to extend the matching via judicious hyperedge selections. Experiments on random, synthetic and real-life hypergraphs show that this new heuristic is highly practical and superior to the others on finding a matching with large cardinality.
CITATION STYLE
Dufossé, F., Kaya, K., Panagiotas, I., & Uçar, B. (2019). Effective Heuristics for Matchings in Hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11544 LNCS, pp. 248–264). Springer. https://doi.org/10.1007/978-3-030-34029-2_17
Mendeley helps you to discover research relevant for your work.