Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LATIN
/
Paper
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming.
Daniel Dadush
Venue
B
LATIN
Year
2012
Proceedings
LATIN
DBLP record
conf/latin/Dadush12 ↗
Browse the full
LATIN paper archive
.