Author:
Abrahamson Jeff,Shokoufandeh Ali
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. J. Abrahamson, A. Shokoufandeh, Lazy robots constrained by at most two polygons, in: IEEE/RJS International Conference on Intelligent Robots and Systems, IROS 2005, pp. 601–606, Alberta, 2005
2. Euclidean TSP between two nested convex obstacles;Abrahamson;Information Processing Letters,2005
3. Minimum of a linear form on the set of all complete cycles of the symmetric group sn;Aizenshtat;Cybernetics and Systems Analysis,1968
4. The travelling salesman problem on permuted Monge matrices;Burkard;Journal of Combinatorial Optimization,1998
5. Efficient special case algorithms for the n-line planar traveling salesman problem;Cutler;Networks,1980