Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds.
Matthias PoloczekGeorg SchnitgerDavid P. WilliamsonAnke van ZuylenPublished in: SIAM J. Comput. (2017)
Keyphrases
- greedy algorithms
- greedy algorithm
- significant improvement
- error bounds
- computationally efficient
- straight forward
- computational efficiency
- theoretical analysis
- machine learning
- recently developed
- orders of magnitude
- benchmark datasets
- worst case
- computational cost
- data structure
- genetic algorithm
- probabilistic model
- machine learning algorithms
- lower bound
- times faster
- bayesian networks
- computer vision
- learning algorithm
- neural network
- randomized algorithms