Near-Linear Algorithms for Geometric Hitting Sets and Set Covers.
Pankaj K. AgarwalJiangwei PanPublished in: Discret. Comput. Geom. (2020)
Keyphrases
- orders of magnitude
- optimization problems
- data structure
- lower and upper bounds
- computationally efficient
- small number
- probability distribution
- directed graph
- disjoint sets
- definite clause
- linear inequalities
- linear space
- decomposition algorithm
- nearest neighbour
- learning algorithm
- graph theory
- combinatorial optimization
- closed form
- computational complexity
- machine learning algorithms
- significant improvement
- markov chain
- computational cost