A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming

Details A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming

2011-09-12

arxiv.org/abs/1109.2477v2

Computer Science

Data Structures and Algorithms

Scientific paper

The Integer Programming Problem (IP) for a polytope P \subseteq R^n is to find an integer point in P or decide that P is integer free. We give an algorithm for an approximate version of this problem, which correctly decides whether P contains an integer point or whether a (1+\eps) scaling of P around its barycenter is integer free in time O(1/\eps^2)^n. We reduce this approximate IP question to an approximate Closest Vector Problem (CVP) in a "near-symmetric" semi-norm, which we solve via a sieving technique first developed by Ajtai, Kumar, and Sivakumar (STOC 2001). Our main technical contribution is an extension of the AKS sieving technique which works for any near-symmetric semi-norm. Our results also extend to general convex bodies and lattices.

Affiliated with

Also associated with

No associations

Rating

A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60158