Author Archives: root

Welcome to visit Chung-Shou Liao’s lab website! Our research mainly focuses on designing efficient combinatorial algorithms that can be used to solve hard optimization problems from real applications. The current research topics we investigate center around network and location problems … Continue reading

News

2018.07.  Our PI receives 2018 Young Scholar Creativity Award, Foundation for the Advancement of Outstanding Scholarship. 2018.06.  Hao-Ting Wei’s paper, entitled An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity, has been accepted by APPROX 2018 . 2017.12.  … Continue reading

Biological Network Alignment

A fundamental goal of biology is to understand the cell as a system of interacting components and especially, almost every biological process is mediated by a network of molecular interactions. In particular, there has been a considerable amount of research … Continue reading

Online Route Planning on Road Networks

Modern technologies such as Global Positioning Systems (GPS) and mobile communication have contributed to the development of dynamic navigation planning based on real-time information. However, traffic conditions vary enormously and unpredictable accidents significantly affect planned routes, which increase the problem … Continue reading

Power Observation on Grids

When the global energy crisis and related issues become critically important, more researchers focus on the energy management problems and especially, Smart Grid is one of the most popular research topics. In order to solve the technical challenges of communications … Continue reading

Capacitated Facility Location

With the rapid growth of international logistics market, one of the most important research issues is designing a large-scale distribution network. The question of large-scale distribution network design is also becoming central to globalization supply chain management. In general, the … Continue reading

Three-dimensional Bin Packing

The bin packing problem is one of the classic NP-hard combinatorial optimization problems. Given a set of n items with positive sizes, the objective is to find a packing in bins of equal capacity to minimize the number of bins … Continue reading