An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature.
Andrew DruckerPublished in: FOCS (2020)
Keyphrases
- computational complexity
- high accuracy
- detection algorithm
- preprocessing
- optimization algorithm
- dynamic programming
- experimental evaluation
- cost function
- times faster
- tree structure
- theoretical analysis
- expectation maximization
- learning algorithm
- linear programming
- matching algorithm
- np hard
- computationally efficient
- linear complexity
- k means
- approximation ratio
- particle swarm optimization
- worst case
- significant improvement
- data structure