Leading ACOLab at National Tsing Hua University. Main research directions cover online algorithms & incremental learning, clustering for unsupervised learning, etc.
Background
Research interests include designing efficient algorithms to solve difficult combinatorial optimization problems from real applications. The lab has developed approximation algorithms with theoretical analysis for well-known hard problems such as online shortest path, facility location, domination, and scheduling and packing problems. Other areas of interest include computational geometry, graph theory, and machine learning. In recent years, more attention is given to dynamic and online algorithms for fundamental problems like data clustering and classification, as well as their applications in AI manufacturing.