Deterministic 2^{O(n)} Algorithms for M-Ellipsoids, Lattice Problems and Volume Estimation
Daniel DadushSantosh S. VempalaPublished in: CoRR (2012)
Keyphrases
- optimization problems
- benchmark problems
- randomized algorithms
- hard problems
- related problems
- computational problems
- combinatorial optimization
- test problems
- benchmark datasets
- graph theory
- problems in computer vision
- estimation problems
- specific problems
- approximate solutions
- run times
- computational geometry
- data structure
- learning algorithm
- theoretical guarantees
- search methods
- computationally efficient
- exact and approximate
- worst case
- np hard problems
- neural network