Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity.
José R. CorreaLaurent FeuilloleyPablo Pérez-LanteroJosé A. SotoPublished in: Discret. Comput. Geom. (2015)
Keyphrases
- computational complexity
- significant improvement
- optimization problems
- computational cost
- theoretical analysis
- worst case
- times faster
- computational efficiency
- data mining algorithms
- orders of magnitude
- memory requirements
- space complexity
- lower complexity
- recently developed
- complexity analysis
- high computational complexity
- polynomial time complexity
- computationally efficient
- data sets
- query processing
- lower bound
- computer vision
- learning algorithm
- data mining
- neural network