Non-abusiveness Helps:An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman problem

S.O. Krumke, L. Laura, M. Lipmann, A. Marchetti Spaccamela, W.E. Paepe, de, D. Poensgen, L. Stougie

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

32 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Non-abusiveness Helps:An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman problem'. Together they form a unique fingerprint.

Mathematics

Computer Science