3 papers
cs.DS2026
Diameter Computation on (Random) Geometric Graphs
Thomas Bläsius, Annemarie Schaub, Marcus Wilhelm
We present an algorithm that computes the diameter of random geometric graphs (RGGs) with expected average degree for constant in $\tilde{O}(n^{\frac{3}{2}(1+δ…
cs.CG2024
Structure and Independence in Hyperbolic Uniform Disk Graphs
Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak +2
We consider intersection graphs of disks of radius in the hyperbolic plane. Unlike the Euclidean setting, these graph classes are different for different values of , where v…
cs.DS2019
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
Lukas Behrendt, Katrin Casel, Tobias Friedrich +3
We generalize the tree doubling and Christofides algorithm, the two most common approximations for TSP, to parameterized approximations for ATSP. The parameters we consider for the…