Branching proofs of infeasibility in low density subset sum problems

Details Branching proofs of infeasibility in low density subset sum problems Branching proofs of infeasibility in low density subset sum problems

2008-07-31

arxiv.org/abs/0808.0023v1

Computer Science

Computational Complexity

Scientific paper

We prove that the subset sum problem has a polynomial time computable certificate of infeasibility for all $a$ weight vectors with density at most $1/(2n)$ and for almost all integer right hand sides. The certificate is branching on a hyperplane, i.e. by a methodology dual to the one explored by Lagarias and Odlyzko; Frieze; Furst and Kannan; and Coster et. al. The proof has two ingredients. We first prove that a vector that is near parallel to $a$ is a suitable branching direction, regardless of the density. Then we show that for a low density $a$ such a near parallel vector can be computed using diophantine approximation, via a methodology introduced by Frank and Tardos. We also show that there is a small number of long intervals whose disjoint union covers the integer right hand sides, for which the infeasibility is proven by branching on the above hyperplane.

Affiliated with

Also associated with

No associations

Rating

Branching proofs of infeasibility in low density subset sum problems 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 Branching proofs of infeasibility in low density subset sum problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Branching proofs of infeasibility in low density subset sum problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-643098