dblp.uni-trier.dewww.uni-trier.de

DBLP Record 'conf/approx/KrumkeLLMPPS02'

BibTeX

@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},
  title     = {Non-abusiveness Helps: An O(1)-Competitive Algorithm for
               Minimizing the Maximum Flow Time in the Online Traveling
               Salesman Problem},
  booktitle = {APPROX},
  year      = {2002},
  pages     = {200-214},
  ee        = {http://link.springer.de/link/service/series/0558/bibs/2462/24620200.htm},
  crossref  = {DBLP:conf/approx/2002},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/approx/2002,
  editor    = {Klaus Jansen and
               Stefano Leonardi and
               Vijay V. Vazirani},
  title     = {Approximation Algorithms for Combinatorial Optimization,
               5th International Workshop, APPROX 2002, Rome, Italy, September
               17-21, 2002, Proceedings},
  booktitle = {APPROX},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2462},
  year      = {2002},
  isbn      = {3-540-44186-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Copyright © 2002-11-08 by Michael Ley (ley@uni-trier.de)