Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids.
Nima AnariShayan Oveis GharanCynthia VinzantPublished in: FOCS (2018)
Keyphrases
- experimental evaluation
- optimal solution
- k means
- particle swarm optimization
- learning algorithm
- preprocessing
- cost function
- computational complexity
- optimization algorithm
- dynamic programming
- probabilistic model
- times faster
- convergence rate
- np hard
- improved algorithm
- recognition algorithm
- polygonal approximation
- relaxation algorithm
- worst case
- combinatorial optimization
- detection algorithm
- theoretical analysis
- simulated annealing
- significant improvement
- similarity measure