39 citations · 60 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
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…
Convex Hulls of Random Walks: Large-Deviation Properties
Gunnar Claussen, Alexander K. Hartmann, Satya N. Majumdar
We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two…