WORST CASE BOUNDS FOR THE EUCLIDEAN MATCHING PROBLEM-t

Abstract

It is shown how the classical mathematical theory of sphere packing can be used to obtain bounds for a greedy heuristic for the bounded euclidean matching problem. In the case of 2 dimensions, bounds are obtained directly. For higher dimensions, an appeal is made to known bounds for the sphere packing problem that have appeared in the mathematical… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics