3 citations · 3 across the 1 of their papers we have counts for
2 papers
cond-mat.stat-mech2022★ 3 cited
Cutting-Plane Algorithms and Solution Whitening for the Vertex-Cover Problem
G. Claussen, A. K. Hartmann
The phase-transition behavior of the NP-hard vertex-cover (VC) combinatorial optimization problem is studied numerically by linear programming (LP) on ensembles of random graphs. A…
cond-mat.stat-mech2016
Convex Hulls of Multiple Random Walks: A Large-Deviation Study
Timo Dewenter, Gunnar Claussen, Alexander K. Hartmann +1
We study the polygons governing the convex hull of a point set created by the steps of independent two-dimensional random walkers. Each such walk consists of discrete time…