Dettaglio pubblicazione
2002, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Pages 200-214 (volume: 2462)
Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem (04b Atto di convegno in volume)
Krumke Sven O., Laura Luigi, Lipmann Maarten, MARCHETTI SPACCAMELA Alberto, de Paepe Willem E., Poensgen Diana, Stougie Leen
ISBN: 3540441867
keywords