Exploring unknown environments is a fundamental task in many domains, e....
The speed-robust scheduling problem is a two-stage problem where given m...
We consider minimum-cardinality Manhattan connected sets with arbitrary
...
Knapsack problems are among the most fundamental problems in optimizatio...
We consider the problem of computing a Steiner tree of minimum cost unde...
In online minimum cost matching on the line, n requests appear one by on...