Maurizio Talamo

Learn More
Process mining techniques are able to extract knowledge from event logs commonly available in today’s information systems. These techniques provide new means to discover, monitor, and improve processes in a variety of application domains. There are two main drivers for the growing interest in process mining. On the one hand, more and more events are being(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 algorithm is presented that allows computer aided layout of entity relationship diagrams on a grid. A standard for the representation of symbols is introduced and aesthetic criteria that should be achieved by a layout algorithm are proposed. The algorithm makes use of some heuristic step for the critical activities. Finally, an algorithm for(More)
In this paper we consider the on-line version of the routing problem with release times. Formally, it consists in a metric space M with a distinguished point o (the origin), plus a sequence of triples < ti; pi; ri > where pi is a point of M , ri speciies the rst moment in which the request is ready to be served, and ti represents the moment in which the(More)
In this paper we prove that the approximate solutions to the Min-Weighted Set Cover Problem provided by Chvatal’s algorithm are combinatorially k-stable with respect to element insertions. Intuitively speaking, we define an approximate solution as combinatorially k-stable with respect to an update operation if its approximation ratio remains the same even(More)
In this paper the problem of efficiently 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 first one the(More)