A heuristic for the Stacker Crane Problem on trees which is almost surely exact

Journal of Algorithms

Volumn 61, Issue 1, 2006, Pages 1-19

  Coja Oghlan, Amin ^a   Krumke, Sven O ^b   Nierhoff, Till ^c  

^a HUMBOLDT UNIVERSITY   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COSTS; POLYNOMIALS; PROBABILITY; TREES (MATHEMATICS);

POLYNOMIAL TIME ALGORITHM; STACKER CRANE PROBLEM; TRANSPORTATION NETWORK; TREES;

OPERATIONS RESEARCH;

EID: 33750634097     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.07.007     Document Type: Article

References (21)

1. Ascheuer N., Krumke S.O., and Rambau J. Online dial-a-ride problems: minimizing the completion time. Proceedings of the 17th STACS. Lecture Notes in Comput. Sci. vol. 1770 (2000), Springer 639-650
2. Atallah M.J., and Kosaraju S.R. Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM J. Comput. 17 (1988) 849-869
3. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties (1999), Springer
4. Ausiello G., Feuerstein E., Leonardi S., Stougie L., and Talamo M. Algorithms for the on-line traveling salesman. Algorithmica 29 (2001) 560-581
5. Burkard R., Fruhwirth B., and Rote G. Vehicle routing in an automated warehouse: Analysis and optimization. Ann. Oper. Res. 57 (1995) 29-44
6. Charikar M., and Raghavachari B. The finite capacity dial-A-ride problem. Proceedings of the 39th FoCS (1998) 458-467
7. Coja-Oghlan A., Krumke S.O., and Nierhoff T. Scheduling a server on a caterpillar network-a probabilistic analysis. Proceedings of the 6th Workshop on Models and Algorithms for Planning and Scheduling Problems (2003)
8. Feuerstein E., and Stougie L. On-line single server dial-a-ride problems. Theoret. Comput. Sci. 268 (2001) 91-105
9. Frederickson G.N., and Guan D.J. Nonpreemptive ensemble motion planning on a tree. J. Algorithms 15 (1993) 29-60
10. Frederickson G.N., Hecht M.S., and Kim C.E. Approximation algorithms for some routing problems. SIAM J. Comput. 7 (1978) 178-193
11. Frieze A. On random symmetric travelling salesman problems. Proceedings of the 43rd FoCS (2002) 789-798
12. Frieze A., and McDiarmid C. Algorithmic theory of random graphs. Random Structures Algorithms 10 (1997) 5-42
13. Gröpl C., Hougardy S., Nierhoff T., and Prömel H.J. Approximation algorithms for the Steiner tree problem in graphs. In: Cheng X., and Du D.-Z. (Eds). Steiner Trees in Industry (2001), Kluwer Academic 235-279
14. In: Grötschel M., Krumke S.O., and Rambau J. (Eds). Online Optimization of Large Scale Systems (2001), Springer, Berlin-Heidelberg-New York
15. Guan D.J. Routing a vehicle of capacity greater than one. Discrete Appl. Math. 81 (1998) 41-57
16. Hauptmeier D., Krumke S.O., Rambau J., and Wirth H.-C. Euler is standing in line. Discrete Appl. Math. 113 (2001) 87-107
17. Janson S., Luczak T., and Ruciński A. Random Graphs (2000), Wiley
18. Johnson D.S., and Papadimitriou C.H. Performance guarantees for heuristics. In: Lawler E.L., Lenstra J.K., Kan A.H.G.R., and Shmoys D.B. (Eds). The Travelling Salesman Problem (1985), Wiley 145-180
19. Knuth D.E. The Art of Computer Programming. Sorting and Searching vol. 3 (1968), Addison-Wesley, Reading, MA
20. Papadimitriou C.H., and Vempala S. On the approximability of the traveling salesman problem. Proceedings of the 32nd ACM Symposium on the Theory of Computing (2000) 126-133
21. Vazirani V. Approximation Algorithms (2001), Springer