Skip to content

A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming.

Daniel Dadush

VenueBLATIN
Year2012
ProceedingsLATIN

Browse the full LATIN paper archive.