Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings.

Daniel Dadush Chris Peikert Santosh S. Vempala

Published in: FOCS (2011)

Keyphrases

orders of magnitude
data structure
rough sets
times faster
graph theory
database
significant improvement
special case
multi objective
computational cost
multi class
worst case
particle swarm optimization
computationally efficient
theoretical analysis
combinatorial optimization