Spanner Approximations in Practice

07/05/2021
by   Markus Chimani, et al.
0

A multiplicative α-spanner H is a subgraph of G=(V,E) with the same vertices and fewer edges that preserves distances up to the factor α, i.e., d_H(u,v)≤α· d_G(u,v) for all vertices u, v. While many algorithms have been developed to find good spanners in terms of approximation guarantees, no experimental studies comparing different approaches exist. We implemented a rich selection of those algorithms and evaluate them on a variety of instances regarding, e.g., their running time, sparseness, lightness, and effective stretch.

READ FULL TEXT

page 1

page 3

page 5

page 7

page 9

page 10

page 11

page 13

research
02/07/2018

Current Flow Group Closeness Centrality for Complex Networks

Current flow closeness centrality (CFCC) has a better discriminating abi...
research
06/22/2022

Sparse Temporal Spanners with Low Stretch

A temporal graph is an undirected graph G=(V,E) along with a function th...
research
04/01/2019

Approximation algorithms and an integer program for multi-level graph spanners

Given a weighted graph G(V,E) and t > 1, a subgraph H is a t--spanner of...
research
07/16/2022

Curve Simplification and Clustering under Fréchet Distance

We present new approximation results on curve simplification and cluster...
research
03/03/2019

Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time

Given parameters α≥ 1,β≥ 0, a subgraph G'=(V,H) of an n-vertex unweighte...
research
11/06/2019

From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization

We generalize the tree doubling and Christofides algorithm, the two most...

Please sign up or login with your details

Forgot password? Click here to reset