BibTeX record conf/approx/KrumkeLLMPPS02

• > Home > conf/approx/KrumkeLLMPPS02

@inproceedings{DBLP:conf/approx/KrumkeLLMPPS02,
  author       = {Sven Oliver Krumke and
                  Luigi Laura and
                  Maarten Lipmann and
                  Alberto Marchetti{-}Spaccamela and
                  Willem de Paepe and
                  Diana Poensgen and
                  Leen Stougie},
  editor       = {Klaus Jansen and
                  Stefano Leonardi and
                  Vijay V. Vazirani},
  title        = {Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing
                  the Maximum Flow Time in the Online Traveling Salesman Problem},
  booktitle    = {Approximation Algorithms for Combinatorial Optimization, 5th International
                  Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2462},
  pages        = {200--214},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45753-4\_18},
  doi          = {10.1007/3-540-45753-4\_18},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/KrumkeLLMPPS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}