Complexity theory is a branch of computer science that studies the resources required to solve computational problems, particularly focusing on the classification of problems based on their inherent ...

Recently, a research team from Hokkaido University made significant progress in the complexity study of the Hitting Geodesic Intervals (HGI) problem. The HGI problem aims to find a small set of ...

The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem. Many aspects of modern applied research ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting recharging stations during the course of a ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

In this paper, we address an interesting variant of the vehicle routing problem with time windows (VRPTW) faced by the China National Petroleum Corporation (CNPC). The CNPC owns a limited number of ...