Efficient algorithms for fixed-precision instances of Bin Packing and Euclidean TSP

Abstract

This paper presents new, polynomial time algorithms for Bin Packing and Euclidean TSP under fixed precision. In this model, integers are encoded as floating point numbers, each with a mantissa and an exponent. Thus, an integer i with i = ai2ti has mantissa ai and exponent ti . This natural representation is the norm in real-world optimization. A set of integers I has L-bit precision if maxi∈ I a i < 2L. In this framework, we show an exact algorithm for Bin Packing and an FPTAS for Euclidean TSP which run in time poly(n) and poly(n + log 1/ε), respectively, when L is a fixed constant. Our algorithm for the later problem is exact when distances are given by the L 1 norm. In contrast, both problems are strongly NP-Hard (and yield PTASs) when precision is unbounded. These algorithms serve as evidence of the significance of the class of fixed precision polynomial time solvable problems. Taken together with algorithms for the Knapsack and Pm||C max problems introduced by Orlin et al., [10] we see that fixed precision defines a class incomparable to polynomial time approximation schemes, covering at least four distinct natural NP-hard problems. © 2008 Springer-Verlag Berlin Heidelberg.