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 proceeding › Conference contribution › Academic

Original language	English
Title of host publication	Lecture Notes in Computer Science
Editors	K. Jansen, et al.
Place of Publication	Berlin, Heidelberg
Publisher	Springer Verlag
Pages	200-214
Publication status	Published - 2002

Access to Document

@inproceedings{ebe358eef07449e1aa99ef18dc0bce2f,

title = "Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem",

author = "S.O. Krumke and L. Laura and M. Lipmann and {Marchetti Spaccamela}, A. and {de Paepe}, W.E. and D. Poensgen and L. Stougie",

year = "2002",

language = "English",

pages = "200--214",

editor = "K. Jansen and {et al.}",

booktitle = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

}

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. / Krumke, S.O.; Laura, L.; Lipmann, M. et al.
Lecture Notes in Computer Science. ed. / K. Jansen; et al. Berlin, Heidelberg: Springer Verlag, 2002. p. 200-214.

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic

TY - GEN

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

AU - Krumke, S.O.

AU - Laura, L.

AU - Lipmann, M.

AU - Marchetti Spaccamela, A.

AU - de Paepe, W.E.

AU - Poensgen, D.

AU - Stougie, L.

PY - 2002

Y1 - 2002

M3 - Conference contribution

SP - 200

EP - 214

BT - Lecture Notes in Computer Science

A2 - Jansen, K.

A2 - et al., null

PB - Springer Verlag

CY - Berlin, Heidelberg

ER -