The modern network aims to prioritize critical traffic over non-critical...
We initiate the study of online routing problems with predictions, inspi...
Algorithms with predictions is a recent framework that has been used to
...
In the k-Connected Directed Steiner Tree problem (k-DST), we are given a...
We consider the online traveling salesman problem on the real line (OLTS...
When the scale of communication networks has been growing rapidly in the...
This study considers the (soft) capacitated vertex cover problem in a dy...