Hypergraphs for Team Formation and Constrained Combinatorial Optimization

Add to your list(s) Download to your calendar using vCal

• Tina Eliassi-Rad (Northeastern University)
• Monday 12 August 2024, 15:00-16:30
• External.

If you have a question about this talk, please contact nobody.

HTA - Hypergraphs: Theory and Applications

Hypergraphs are useful mathematical representations for numerous applications. In this talk, I will present two examples: (1) team formation and (2) constrained combinatorial optimization. First, I will discuss the problem of assigning entities to teams as hypergraph discovery, where we optimize for hypergraphs that are resilient and optimized for diffusion. Second, I will discuss how encoding higher-order constraints as hyperedges and learning hypergraph neural networks provide scalable and generalizable solutions to constrained combinatorial optimization problems. The papers for the talk are at https://arxiv.org/abs/2403.04063 ;and https://doi.org/10.1038/s42256-024-00833-7. 

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• External
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.