4 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.CC2008
Branching proofs of infeasibility in low density subset sum problems
Gabor Pataki, Mustafa Tural
We prove that the subset sum problem has a polynomial time computable certificate of infeasibility for all weight vectors with density at most and for almost all integ…
math.OC2008★ 1 cited
Parallel Approximation and Integer Programming Reformulation
Gabor Pataki, Mustafa Tural
We show that in a knapsack feasibility problem an integral vector , which is short, and near parallel to the constraint vector gives a branching direction with small integer wid…
math.NT2008★ 4 cited
On sublattice determinants in reduced bases
Gabor Pataki, Mustafa Tural
We prove several inequalities on the determinants of sublattices in LLL-reduced bases. They generalize the inequalities on the length of the shortest vector proven by Lenstra, Lens…