Learn More
In this paper the problem of eeciently serving a sequence of requests presented in an on-line fashion located at points of a metric space is considered. We call this problem the On-Line Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We consider two versions of the problem. In the rst one the server(More)
In this paper the problem of eeciently serving a sequence of requests that are presented in a metric space in an on-line fashion and then returning back to the departure point is considered. The problem, that is the on-line version of a variant of the Traveling Salesman Problem (namely the Vehicle Routing Problem with release times), and that for the sake(More)
An extension of the disjoint set union problem is considered, where the extra primitive backtrack(i) can undo the last i unions not yet undone. Let n be the total number of elements in all the sets. A data structure is presented that supports each union and find in O(lognj loglogn) worst-case time and each backtrack(i) in 0(1) worst-case time, irrespective(More)
M.Talamo is the CEO of the Initiative for the Development of an IT Infrastructure for Inter-Organization Cooperation (namely, " Coordinamento dei Progetti Intersettoriali ") of AIPA-" Autorità per l'Informatica nella Pubblica Amministrazione ". Abstract In this paper we present and discuss a novel architectural approach supporting the integration among(More)