2 papers
cs.DS2020
On the Size of Minimal Separators for Treedepth Decomposition
Zijian Xu, Vorapong Suppakitpaisarn
Treedepth decomposition has several practical applications and can be used to speed up many parameterized algorithms. There are several works aiming to design a scalable algorithm…
cs.LG2019
Solving NP-Hard Problems on Graphs with Extended AlphaGo Zero
Kenshin Abe, Zijian Xu, Issei Sato +1
There have been increasing challenges to solve combinatorial optimization problems by machine learning. Khalil et al. proposed an end-to-end reinforcement learning framework, S2V-D…