1040 search results - page 10 / 208 » Rounding algorithms for covering problems |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
ESCAPE
2007
Springer
14 years 1 months ago
2007
Springer
WAOA
2004
Springer
14 years 25 days ago
2004
Springer
ICCS
2003
Springer
14 years 21 days ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
