We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...