Ausiello G.

G. Ausiello

Information about the author G. Ausiello will soon be added to the site.
Found 4 papers in total
Reductions, completeness and the hardness of approximability
Reductions, completeness and the hardness of approximability
2006
In computability and in complexity theory reductions are widely used for mapping sets...
Algorithms for the on-line quota traveling salesman problem
Algorithms for the on-line quota traveling salesman problem
2004
The Quota Traveling Salesman Problem is a generalization of the well-known Traveling...
Algorithms for the on-line travelling salesman
Algorithms for the on-line travelling salesman
2001
In this paper the problem of efficiently serving a sequence of requests presented in...
Algorithms for the on-line travelling salesman
Algorithms for the on-line travelling salesman
2001
In this paper the problem of efficiently serving a sequence of requests presented in...
Papers per page: