Effective Heuristics for Matchings in Hypergraphs

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...

Full description

Saved in:
Bibliographic Details
Published inAnalysis of Experimental Algorithms Vol. 11544; pp. 248 - 264
Main Authors Dufossé, Fanny, Kaya, Kamer, Panagiotas, Ioannis, Uçar, Bora
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2019
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
dimensional matching
Karp-Sipser heuristic
Matching in hypergraphs
Tensor scaling
Online AccessGet full text
ISBN9783030340285
3030340287
ISSN0302-9743
1611-3349
1611-3349
DOI10.1007/978-3-030-34029-2_17

Cover

More Information
Summary: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.
ISBN:9783030340285
3030340287
ISSN:0302-9743
1611-3349
1611-3349
DOI:10.1007/978-3-030-34029-2_17