S. Takabe

Satoshi TAKABE, Ph.D.

Department of Computer Science, Nagoya Institute of Technology

Assistant Professor (WADAYAMA group)


  • Research interests:

Spin-glass theory and its applications to optimization problems and statistical inference

Typical performance of approximation algorithms for NP-hard problems

Phase transition on complex networks

  • Journal papers:

6. S. Takabe, T. Maehara, and K. Hukushima, “Typical Approximation Performance for Maximum Coverage Problem,” arXiv

5. J. Takahashi, S. Takabe, and K. Hukushima, “An exact algorithm exhibiting RS-RSB/easy-hard correspondence for the maximum independent set problem,” Journal of the Physical Society of Japan 86, 073001 (2017), arXiv

4. S. Takabe and K. Hukushima, “Typical Performance of Approximation Algorithms for NP-hard Problems,” Journal of Statistical Mechanics: Theory and Experiment, 2016, 113401, (2016), arXiv

3. S.Takabe and K. Hukushima, “Statistical-mechanical Analysis of Linear Programming Relaxation for Combinatorial Optimization Problems,” Physical Review E 93, 053308 (2016), arXiv

2. S. Takabe and K. Hukushima, “Typical Behavior of the Linear Programming Method for Combinatorial Optimization Problems: A Statistical-mechanical Perspective,” Journal of the Physical Society of Japan 83, 043801 (2014), arXiv

1. S. Takabe and K. Hukushima, “Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm,” Physical Review E 89, 062139 (2014), arXiv