103 citations · 184 across the 3 of their papers we have counts for
Showing cond-mat.dis-nnShow all
2 papers · 1 filter
cond-mat.dis-nn2004★ 30 cited
Clustering analysis of the ground-state structure of the vertex-cover problem
Wolfgang Barthel, Alexander K. Hartmann
Vertex cover is one of the classical NP-complete problems in theoretical computer science. A vertex cover of a graph is a subset of vertices such that for each edge at least one of…
cond-mat.dis-nn2001★ 103 cited
Hiding solutions in random satisfiability problems: A statistical mechanics approach
W. Barthel, A. K. Hartmann, M. Leone +3
A major problem in evaluating stochastic local search algorithms for NP-complete problems is the need for a systematic generation of hard test instances having previously known pro…