We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...