Invited by Prof. Heping Zhang and Prof. Shoujun Xu of School of Mathematics and Statistics, Prof. Xiaoyan Zhang from School of Mathematical Sciences, Nanjing Normal Universitywill give a lecture.

Title: Clustering Graph Routing Problems

Time: 11:00 a.m.,Jul.2nd, 2021

Conference ID: 839 925 742( Tencent Conference), PASSWD: 0702

Abstract: Routing problems such as TSP and Clustering TSP have been widely studied since the early 1970s. These problems are usually NP-hard implying that no polynomial time exact algorithm is excepted to exist unless P = NP. In this talk, we will give some approximation algorithms for some more generalized Clustering Graph Routing Problems.