How to collect balls moving in the euclidean plane

Electronic Notes in Theoretical Computer Science

Volumn 91, Issue , 2004, Pages 229-245

  Asahiro, Yuichi ^a   Horiyama, Takashi ^c   Makino, Kazuhisa ^b   Ono, Hirotaka ^d   Sakuma, Toshinori ^d   Yamashita, Masafumi ^d  

^a KYUSHU SANGYO UNIVERSITY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c KYOTO UNIVERSITY   (Japan)

^d KYUSHU UNIVERSITY   (Japan)

Author keywords

Combinatorial optimization; Moving Target TSP; Partially ordered set; Vehicle routing problem

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIALS; ROBOTS; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; MOVING-TARGET TSP; PARTIALLY ORDERED SET; VEHICLE ROUTING PROBLEM;

PROBLEM SOLVING;

EID: 18944362266     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2003.12.015     Document Type: Conference Paper

References (16)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows : Theory, Algorithms and Applications. 1993;Prentice-Hall
2. Atallarh M., Kosaraju S. Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM Journal on Computing. 17:1988;849-869
3. Bauernöppel F., Kranakis E., Krizanc D., Maheshwari A., Sack J.-R., Urrutia J. Planer stage graphs: Characterizations and applications. Theoretical Computer Science. 175:1997;239-255
4. Chalasani P., Motwani R., Rao A. Approximation Algorithms for Robot Grasp and Delivery. 2nd International Workshop on Algorithmic Foundations of Robotics (WAFR). 1996;347-362
5. Cook W.J., Cunningham W.H., Pulleyblank W.R., Schrijver A. Combinatorial Optimization. 1998;John Wiley & Sons
6. Evan S., Itai A., Shamir A. On the Complexity of Timetabling and Multicommodity Flow Problems. SIAM Journal of Computing. 5:(4):1976;691-703
7. Garey M.R., Johnson D.S. Computers and Intractability. 1979;Freeman, New York
8. Hammar M., Nilsson B.J. Approximation results for kinetic variants of TSP. 26th International Colloquium, Automata, Languages and Programming, ICALP'99. LNCS. 1644:1999;392-401
9. Helvig C.S., Robins G., Zelikovsky A. Moving Target TSP and Related Problems. 6th Annual European Symposium, Algorithms - ESA '98. LNCS. 1461:1998;453-464
10. Karuno Y., Nagamochi H., Ibaraki T. Better Approximation Ratios for the Single-Vehicle Scheduling Problems on Line-Shaped Networks. Networks. 39:(4):2002;203-209
11. Knuth D.E. Fundamental Algorithms. Third Edition :1997;Addison-Wesley
12. Lovász L., Plummer M.D. Matching Theory. Annals of Discrete Matghematics. 29:1986;North-Holland
13. Nielsen F. Output-sensitive peeling of convex and maximal layers. Information Processing Letters. 59:1996;255-259
14. Psaraftis H.N., Solomon M.M., Magnanti T.L., Kim T. Routing and Scheduling on a Shoreline with Release Times. Management Science. 36:(2):1990;212-223
15. Rote G. The N-line traveling salesman problem. Networks. 22:1992;91-108
16. Tsitsiklis J.N. Special cases of traveling salesman and repairman problems with time windows. Networks. 22:1992;263-282