235 citations · 345 across the 30 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cond-mat.dis-nn2013★ 8 cited
Typical behavior of the linear programming method for combinatorial optimization problems: From a statistical-mechanical perspective
Satoshi Takabe, Koji Hukushima
Typical behavior of the linear programming problem (LP) is studied as a relaxation of the minimum vertex cover problem, which is a type of the integer programming problem (IP). To…
cond-mat.dis-nn2013★ 14 cited
Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm
Satoshi Takabe, Koji Hukushima
We study minimum vertex cover problems on random α-uniform hypergraphs using two different approaches, a replica method in statistical mechanics of random systems and a leaf remova…