10/23/2023 - 10/29/2023
Rényi Institute
For a graph \(G=(V,E)\) with edge weight \(w:E\rightarrow \mathbb{R}^+\), a \(t\)-spanner is a spanning subgraph \(H\) such that for all pair of vertices \(u,v\in V\), we have \(d_H(u,v)\leq t\cdot d_G(u,v)\), where \(d_G(u,v)\) denotes the shortest path distance between vertices \(u\) and \(v\) in \(G\).