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. de Paepe, D. Poensgen, L. Stougie

    Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademic

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science
    EditorsK. Jansen, et al.
    Place of PublicationBerlin, Heidelberg
    PublisherSpringer Verlag
    Publication statusPublished - 2002

    Cite this