3 citations · 3 across the 2 of their papers we have counts for
3 papers
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
Janos Csirik, David S. Johnson, Claire Kenyon
The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this…
On the Sum-of-Squares Algorithm for Bin Packing
Janos Csirik, David S. Johnson, Claire Kenyon +3
In this paper we present a theoretical analysis of the deterministic on-line {\em Sum of Squares} algorithm () for bin packing introduced and studied experimentally in \cite{CJ…
The Geometric Maximum Traveling Salesman Problem
Alexander Barvinok, Sandor P. Fekete, David S. Johnson +3
We consider the traveling salesman problem when the cities are points in R^d for some fixed d and distances are computed according to geometric distances, determined by some norm.…