#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2005

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Luca Allulli, Giorgio Ausiello, Luigi Laura
- COCOON
- 2005

Vehicle Routing Problems are generalizations of the well known Traveling Salesman Problem; we focus on the on-line version of these problems, where requests are not known in advance and arrive over time. We introduce a model of lookeahead for this class of problems, the time lookahead ∆, which allows an on-line algorithm to foresee all the requests that… (More)

- Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura
- TAMC
- 2006

- Luca Allulli, Peter Lichodzijewski, Norbert Zeh
- SODA
- 2007

We present a cache-oblivious algorithm for computing single-source shortest paths in undirected graphs with non-negative edge lengths. The algorithm incurs O(√(<i>nm</i> log <i>w</i>)/B+(<i>m</i>/B) log <i>n</i> +MST (<i>n, m</i>)) memory transfers on a graph with <i>n</i> vertices, <i>m</i> edges, and real edge lengths between 1 and <i>W</i>;… (More)

- Luca Allulli
- 2007

Acknowledgments It is well-known that research is not an easy task, and that progress in research is discontinuous; nonetheless I always felt a bit uncomfortable in times where progress was slow, because I had an (unjustified) feeling to waste time. Luckily, " La Sapienza " an extremely warm and positive environment. Firstly, I would like to thank my… (More)

- Luca Allulli, Roberto Baldoni, Luigi Laura, Sara Tucci Piergiovanni
- IEEE Trans. Computers
- 2007

- Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
- Theor. Comput. Sci.
- 2008

We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited ability to foresee future requests, what is the improvement that can be achieved in terms of the competitive ratio? We consider several online server routing problems in this setting,… (More)

- Luca Allulli
- 2005

This report presents the current state of my research activity in the framework of my Doctorate program. The main problem I am studying is how to obtain an I/O efficient cache oblivious Single Source Shortest Paths (SSSP) algorithm for undirected graphs. The background of my work is described in Section 1, where we explain why it is important to develop… (More)

- ‹
- 1
- ›