| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436223 | Theoretical Computer Science | 2009 | 4 Pages |
Abstract
We improve on an O(n5logn) algorithm by Kats and Levner [V. Kats, E. Levner, A polynomial algorithm for 2-cyclic robotic scheduling, in: Gelbukh, Reyes-García (Eds.), Proceedings of MICAI’06, in: LNAI, vol. 4293, Springer Verlag, 2006, pp. 439–449] for 2-cyclic robotic scheduling. We provide in this work an O(n2logn) algorithm for this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
