13 citations · 22 across the 8 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
Ming Sun, Xinyu Wu, Yi Zhou +2
The Steiner tree problem aims to determine a minimum edge-weighted tree that spans a given set of terminal vertices from a given graph. In the past decade, a considerable number of…
cs.LG2022
On Monte Carlo Tree Search for Weighted Vertex Coloring
Cyril Grelier, Olivier Goudet, Jin-Kao Hao
This work presents the first study of using the popular Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem. S…