Effective heuristics for matchings in hypergraphs

Ioannis Panagiotas 1 Bora Uçar 1 Fanny Dufossé 2 Kamer Kaya 3
1 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
2 DATAMOVE - Data Aware Large Scale Computing
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : The problem of finding a maximum cardinality matching in a d-partite d-uniform hypergraph is an important problem in combinatorial optimization and has beentheoretically analyzed by several researchers. In this work, we first devise heuristics for this problem by generalizing the existing cheap graph matching heuristics. Then, we 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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

Contributor : Equipe Roma <>
Submitted on : Tuesday, February 19, 2019 - 4:35:03 PM
Last modification on : Tuesday, April 2, 2019 - 2:52:09 AM


Files produced by the author(s)


  • HAL Id : hal-01924180, version 4


Ioannis Panagiotas, Bora Uçar, Fanny Dufossé, Kamer Kaya. Effective heuristics for matchings in hypergraphs. [Research Report] RR-9224, Inria Grenoble Rhône-Alpes. 2018, pp.1-20. ⟨hal-01924180v4⟩



Record views


Files downloads