Perfect matching in bipartite hypergraphs subject to a demand graph

Lior Aronshtam (), Hagai Ilani () and Elad Shufan ()
Additional contact information
Lior Aronshtam: SCE – Shamoon College of Engineering
Hagai Ilani: SCE – Shamoon College of Engineering
Elad Shufan: SCE – Shamoon College of Engineering

Annals of Operations Research, 2023, vol. 321, issue 1, No 2, 39-48

Abstract: Abstract Motivated by the problem of assigning plots to tenants, we present a version of the bipartite hypergraph matching problem. This version deals with a hypergraph with a constraint on its hyperedges, defined by a demand graph. We study the complexity of the matching problem for different demand graphs. The matching problem for 3-uniform hypergraphs is polynomially solvable if the set of perfect matchings of the demand graph can be polynomially generated. On the other hand, when the number of disjoint even cycles in the demand graph is $$\varvec{\Omega (n^{1/k})}$$ Ω ( n 1 / k ) , for some constant $$\varvec{k}$$ k , the matching problem is NP-complete. For non-uniform hypergraphs, we show that the problem is NP-complete, even for very simple demand graphs.

Keywords: Perfect matching; Bipartite hypergraph; Assignment (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-022-05073-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:321:y:2023:i:1:d:10.1007_s10479-022-05073-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-022-05073-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().