Greg N. Frederickson

TL;DR: In this paper, a mixed-strategy heuristic with a bound of 9/5 is presented for the stacker-crane problem and a tour-splitting heuristic is given for k-person variants of the traveling salesman problem.

TL;DR: Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained route to that of an optimal are determined.

TL;DR: Algorithms are presented that run in time which depends nontrivially on the rank k of the element to be selected and which is sublinear with respect to set cardinality, and all bounds are shown to be optimal to within a constant multiplicative factor.

TL;DR: A succinct and easily searchable representation of the set of intervertex distances of a tree is given and the complete algorithm for path selection is asymptotically optimal in the worst case and the algorithms for p-center location improve on previous methods.

TL;DR: It is shown that a scheduling policy minimized the expected flow timq only if it is shortest expected processing time tint, and that a policy minimizes the expected make and onlyif it is longest expected processingTime fast.