NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
From MaRDI portal
Publication:6564769
DOI10.1007/s11425-022-2175-5MaRDI QIDQ6564769
Cong-Ying Han, Tian-de Guo, Yuchen Shi
Publication date: 1 July 2024
Published in: Science China. Mathematics (Search for Journal in Brave)
reinforcement learningPrim's algorithmdegree-constrained minimum spanning tree problemSteiner tree problem in graphsminimum routing cost spanning tree problem
Programming involving graphs or networks (90C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
