On January 3, 2023, Youngho Yoo from Texas A&M University gave a talk at the Discrete Math Seminar on the approximation algorithm for the traveling salesman problem on cubic graphs by showing an upper bound on the length of a shortest closed spanning walk in a simple 2-connected subcubic graph. The title of his talk was “Approximating TSP walks in subcubic graphs“.
기초과학연구원 이산수학그룹
