Spanners in Hypergraphs

In this work, we explore parallel construction of spanners in hypergraphs. Spanners include all vertices and a subset of edges while ensuring shortest distances within an allowable stretch, making them crucial for efficiently approximating graph structures. We build on the state-of-the-art algorithm for parallel graphs spanners and extend it for hypergraphs focusing on optimizing the size without compromising stretch. We propose techniques to address memory and performance challenges when dealing with hypergraphs.