Grasp and delivery for moving objects on broken lines

Theory of Computing Systems

Volumn 42, Issue 3, 2008, Pages 289-305

  Asahiro, Yuichi ^a   Miyano, Eiji ^b   Shimoirisa, Shinichi ^b  

^a KYUSHU SANGYO UNIVERSITY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Approximation algorithm; Grasp and delivery; MAXSNP hardness; Moving objects

Indexed keywords

CONSTANT SPEED; GRASP AND DELIVERY; MAX SNP HARDNESS; MOVING OBJECTS; ROBOT ARMS; ROBOT NAVIGATION; VEHICLE ROUTING PROBLEMS;

APPROXIMATION ALGORITHMS;

ROBOTIC ARMS;

EID: 38949156542     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9081-y     Document Type: Conference Paper

References (18)

1. Agarwal, P.K., Sharir, M.: Davenport-Schinzel sequences and their geometric applications. In: Sack, J., Urutia, J. (eds.) Handbook of Computational Geometry. Elsevier, Amsterdam (1999)
2. Asahiro, Y., Horiyama, T., Makino, K., Ono, H., Sakuma, T., Yamashita, M.: How to collect balls moving in the Euclidean plane. Discrete Appl. Math. 154(16), 2247-2262 (2006)
3. Asahiro, Y., Miyano, E., Shimoirisa, S.: K-collect tours for moving objects with release times and deadlines. In: Proc. Systemics, Cybernetics and Informatics, vol. III, pp. 192-197, 2005
4. Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: Proc. ACM Symposium on Theory of Computing, pp. 166-174, 2004
5. Blum, A., Chawla, S., Karger, D., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward TSP. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 46-55, 2003
6. Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines under real-time scheduling. SIAM J. Comput. 31(2), 331-352 (2001)
7. Chalasani, P., Motwani, R., Rao, A.: Approximation algorithms for robot grasp and delivery. In: Proc. International Workshop on Algorithmic Foundations of Robotics, pp. 347-362, 1996
8. Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problem. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 348-356, 2001
9. Desrochers, M., Desrosiers, J., Solomon, M.M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40, 342-354 (1992)
10. Hammar, M., Nilsson, B.J.: Approximation results for kinetic variants of TSP. In: Proc. International Colloquium on Automata, Languages and Programming, pp. 392-401, 1999
11. Helvig, C.S., Robins, G., Zelikovsky, A.: Moving target TSP and related problems. In: Proc. European Symposium on Algorithms, pp. 453-464, 1998
12. Karger, D., Stein, C., Wein, J.: Scheduling algorithms. In: Atallah, M.J. (ed.) Handbook of Algorithms and Theory of Computation. CRC Press, Boca Raton (1997)
13. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem. Wiley, Chichester (1985)
14. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343-362 (1977)
15. Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag. Sci. 15, 102-109 (1968)
16. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
17. Spieksma, F.C.R.: On the approximability of an interval scheduling problem. J. Sched. 2, 215-227 (1999)
18. Toth, P., Vigo, D.: An overview of vehicle routing problems. In: Tosh, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM, Philadelphia (2001)