Skip to main content
SpringerLink
Log in

Perfect matching in bipartite hypergraphs subject to a demand graph

  • Original Research
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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})}\), for some constant \(\varvec{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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Annamalai, C. (2016). Finding perfect matchings in bipartite hypergraphs. In Proceedings of the twenty-seventh annual acm-siam symposium on discrete algorithms (pp. 1814–1823).

  • Aronshtam, L., Ilani, H., Shufan, E. (2019). Satisfying allocation of plots to tenants. In Proceedings of the 9th multidisciplinary international conference on scheduling: Theory and applications (pp. 30–41).

  • Asadpour, A., Feige, U., & Saberi, A. (2012). Santa Claus meets hypergraph matchings. ACM Transactions on Algorithms (TALG), 8(3), 1–9.

    Article  Google Scholar 

  • Biró, P., & McDermid, E. (2010). Matching with sizes (or scheduling with processing set restrictions). In Technical report TR-2010-307.

  • Biró, P., & McDermid, E. (2014). Matching with sizes (or scheduling with processing set restrictions). Discrete Applied Mathematics, 164, 61–67.

    Article  Google Scholar 

  • Borndörfer, R., & Heismann, O. (2015). The hypergraph assignment problem. Discrete Optimization, 15, 15–25.

    Article  Google Scholar 

  • Bronfman, S., Alon, N., Hassidim, A., & Romm, A. (2018). Redesigning the Israeli medical internship match. ACM Transactions on Economics and Computation (TEAC), 6(3–4), 1–18.

    Google Scholar 

  • Burkard, R., Dell’Amico, M., & Martello, S. (2012). Assignment problems: Revised reprint. SIAM.

  • Chiba, S., Fujita, S., Kawarabayashi, K.-I., & Sakuma, T. (2014). Minimum degree conditions for vertex-disjoint even cycles in large graphs. Advances in Applied Mathematics, 54, 105–120.

    Article  Google Scholar 

  • Chiba, S., & Yamashita, T. (2018). Degree conditions for the existence of vertex-disjoint cycles and paths: A survey. Graphs and Combinatorics, 34(1), 1–83.

    Article  Google Scholar 

  • Chudnovsky, M., & Seymour, P. (2012). Perfect matchings in planar cubic graphs. Combinatorica, 32(4), 403–424.

    Article  Google Scholar 

  • Cygan, M., Grandoni, F., Mastrolilli, M. (2013). How to sell hyperedges: The hypermatching assignment problem. In Proceedings of the twenty-fourth annual acm-siam symposium on discrete algorithms (pp. 342–351).

  • Delorme, M., Garcıa, S., Gondzio, J., Kalcsics, J., Manlove, D., Pettersson, W. (2020). Stability in the the hospitals/residents problem with couples and ties: Mathematical models and computational studies. Technical report ERGO-20-003.

  • Esperet, L., Kardoš, F., King, A. D., Král, D., & Norine, S. (2011). Exponentially many perfect matchings in cubic graphs. Advances in Mathematics, 227(4), 1646–1664.

    Article  Google Scholar 

  • Fukuda, K., & Matsui, T. (1994). Finding all the perfect matchings in bipartite graphs. Applied Mathematics Letters, 7(1), 15–18.

    Article  Google Scholar 

  • Holyer, I. (1981). The np-completeness of edge-coloring. SIAM Journal on computing, 10(4), 718–720.

    Article  Google Scholar 

  • Karp, R.M. (1972). Reducibility among combinatorial problems. Complexity of computer computations (pp. 85–103). Springer

  • Kojima, F., Pathak, P. A., & Roth, A. E. (2013). Matching with couples: Stability and incentives in large markets. The Quarterly Journal of Economics, 128(4), 1585–1632.

    Article  Google Scholar 

  • Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval research logistics quarterly, 2(1–2), 83–97.

    Article  Google Scholar 

  • Lovász, L., & Plummer, M.D. (1986). Matching theory. In Annals of discrete mathematics, 29.

  • Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. John Wiley & Sons Inc.

  • Marx, D., & Schlotter, I. (2011). Stable assignment with couples: Parameterized complexity and local search. Discrete Optimization, 8(1), 25–40.

    Article  Google Scholar 

  • Ronn, E. (1990). Np-complete stable matching problems. Journal of Algorithms, 11(2), 285–304.

    Article  Google Scholar 

  • Schrijver, A. (1998). Counting 1-factors in regular bipartite graphs. Journal of Combinatorial Theory, Series B, 72(1), 122–135.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Engineering, SCE – Shamoon College of Engineering, Ashdod, Israel

    Lior Aronshtam

  2. Department of Industrial Engineering and Management, SCE – Shamoon College of Engineering, Ashdod, Israel

    Hagai Ilani

  3. Physics Department, SCE – Shamoon College of Engineering, Ashdod, Israel

    Elad Shufan

Authors
  1. Lior Aronshtam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hagai Ilani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elad Shufan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elad Shufan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aronshtam, L., Ilani, H. & Shufan, E. Perfect matching in bipartite hypergraphs subject to a demand graph. Ann Oper Res 321, 39–48 (2023). https://doi.org/10.1007/s10479-022-05073-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-022-05073-9

Keywords

Search

Navigation