Skip to main content
English
Italiano
Search form
Search
legibility:
standard
|
enhanced
Department of Computer, Control and Management Engineering
Toggle navigation
Department
Contacts
Foreword
How to reach us
Management
People
Structures
Laboratories
Classrooms
Library
Teaching
Study programs
PhD programs
Teaching laboratories
Multimedia
Research
Overview
Research areas
Research Laboratories
Seminars and events
Research reports
DIAG Reports
Technical reports
interdepartmental centers
Spin-offs
Public engagement
News
News
Events calendar
DIAG on media
Seminars & events
Home
»
Tipologia Iris
»
01a Articolo Rivista
01a Articolo in rivista
Re-optimization of minimum and maximum traveling salesman’s tours
The on-line asymmetric traveling salesman problem
The online Prize-Collecting Traveling Salesman Problem
On the power of lookahead in on-line server routing problems
Reductions, completeness and the hardness of approximability
Small stretch spanners on dynamic graphs
Partially dynamic maintenance of minimum weight hyperpaths
Completeness in differential approximation classes
Algorithms for the On Line Quota Traveling Salesman Problem
Algorithms for the on-line travelling salesman
« first
‹ previous
…
377
378
379
380
381
382
383
384
385
…
next ›
last »
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma
