Back to Search
Start Over
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
- Source :
-
Journal of Algorithms . Sep2006, Vol. 61 Issue 1, p1-19. 19p. - Publication Year :
- 2006
-
Abstract
- Abstract: Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the edges of G that serves all requests. The server has capacity one, and starts and stops at the same vertex. In this paper, we consider the case that the transportation network G is a tree, and that the requests are chosen randomly according to a certain class of probability distributions. We show that a polynomial time algorithm by Frederickson and Guan [J. Algorithms 15 (1993) 29–60], which guarantees a 4/3-approximation in the worst case, on almost all inputs finds a minimum-cost tour, along with a certificate of the optimality of its output. [Copyright &y& Elsevier]
- Subjects :
- *DISTRIBUTION (Probability theory)
*ALGORITHMS
*PROBABILITY theory
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 01966774
- Volume :
- 61
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Journal of Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 23046747
- Full Text :
- https://doi.org/10.1016/j.jalgor.2004.07.007