Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

On-line single-server dial-a-ride problems

- E. Feuerstein, L. Stougie
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 6 October 2001

In this paper results on the dial-a-ride problem with a single server are presented. Requests for rides consist of two points in a metric space, a source and a destination. A ride has to be made by… Expand

Algorithms for the on-line travelling salesman

- G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo
- Computer Science, Chemistry
- 1999

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… Expand

- 75
- 13

Competitive Algorithms for the On-line Traveling Salesman

- G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo
- Computer Science
- WADS
- 16 August 1995

In this paper the problem of efficiently 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… Expand

On Capital Investment

- Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi, A. Rosén
- Computer Science
- ICALP
- 8 July 1996

We deal with the problem of making capital investments in machines for manufacturing a product. Opportunities for investment occur over time, every such option consists of a capital cost for a new… Expand

Algorithms for the On-Line Travelling Salesman1

- G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo
- Mathematics, Computer Science
- Algorithmica
- 1 April 2001

Abstract. 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… Expand

Composite Retrieval of Diverse and Complementary Bundles

- S. Amer-Yahia, F. Bonchi, C. Castillo, E. Feuerstein, Isabel Méndez-Díaz, P. Zabala
- Computer Science
- IEEE Transactions on Knowledge and Data…
- 17 February 2014

Users are often faced with the problem of finding complementary items that together achieve a single common goal (e.g., a starter kit for a novice astronomer, a collection of question/answers related… Expand

On Capital Investment

- Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi, A. Rosén
- Mathematics, Computer Science
- Algorithmica
- 1 May 1999

Abstract. We deal with the problem of making capital investments in machines for manufacturing a product. Opportunities for investment occur over time, every such option consists of a capital cost… Expand

Dynamic algorithms for shortest paths in planar graphs

- E. Feuerstein, A. Marchetti-Spaccamela
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 16 August 1993

Abstract We propose data structures for maintaining shortest paths in planar graphs in which the weight of an edge is modified. Our data structures allow us to compute, after an update, the… Expand

Serving Requests with On-line Routing

- G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo
- Computer Science
- SWAT
- 6 July 1994

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… Expand

New Stochastic Algorithms for Scheduling Ads in Sponsored Search

- E. Feuerstein, Pablo Ariel Heiber, Javier Martínez-Viademonte, Ricardo Baeza-Yates
- Computer Science
- Latin American Web Conference (LA-WEB )
- 31 October 2007

We introduce a family of algorithms for the selection of ads in sponsored search that intends to increase the variety of choices, while not significantly reducing revenue and maintaining an incentive… Expand