Sciweavers

Share
ISAAC
2003
Springer

A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact

9 years 3 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
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 [9], 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.
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof
Added 07 Jul 2010
Updated 07 Jul 2010
Type Conference
Year 2003
Where ISAAC
Authors Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
Comments (0)
books