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

@inproceedings{Krumke2002NonabusivenessHA,
  title={Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem},
  author={Sven Oliver Krumke and Luigi Laura and Maarten Lipmann and Alberto Marchetti-Spaccamela and Willem de Paepe and Diana Poensgen and Leen Stougie},
  booktitle={APPROX},
  year={2002}
}
In the online traveling salesman problem OLTSP requests for visits to cities arrive online while the salesman is traveling. We study the Fmax-OLTSP where the objective is to minimize the maximum flow time. This objective is particularly interesting for applications. Unfortunately, there can be no competitive algorithm, neither deterministic nor randomized. Hence, competitive analysis fails to distinguish online algorithms. Not even resource augmentation which is helpful in scheduling works as a… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

W

M. Blom, S. O. Krumke
  • E. de Paepe, and L. Stougie. The online-TSP against fair adversaries. Informs Journal on Computing, 13(2):138–148,
  • 2001
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

W

S. O. Krumke
  • E. de Paepe, D. Poensgen, and L. Stougie. News from the online traveling repairman. In Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, volume 2136 of Lecture Notes in Computer Science, pages 487–499,
  • 2001

Th

H. Kellerer
  • Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pages 418–426,
  • 1996
VIEW 1 EXCERPT