Giorgio Gambosi

Learn More
Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chip. In this paper we introduce an extension of the Interval Routing Scheme k-IRS to the multi-dimensional case hk; di-MIRS, where k is the number of intervals and d(More)
We propose an incremental algorithm to maintain a DFS-forest in a directed acyclic graph under a sequence of arc insertions in 0( nm) worst case total time, where n is the number of nodes and m is the number of arcs after the insertions. This compares favorably with the time required to recompute DFS from scratch by using Tarjan’s O( R + m) algorithm any(More)
We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem of temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we characterize its competitive ratio in terms of the combinatorial(More)
This paper reports the experience of the development and the evaluation of a set of pre-competitive tools to support legal professionals in exploring a complex corpus of norms and documents in the legal domain. The research addresses two complementary goals: using ICT to support the simplification of the corpus of norms and using ICT to facilitate search(More)