On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary.
Peihuang HuangWenxing ZhuLongkun GuoPublished in: TAMC (2019)
Keyphrases
- min max
- computational complexity
- space complexity
- orders of magnitude
- worst case
- data structure
- computational cost
- times faster
- multiobjective optimization
- recently developed
- benchmark datasets
- memory requirements
- line segments
- hough transform
- theoretical analysis
- computationally efficient
- significant improvement
- learning algorithm
- genetic algorithm
- reduced complexity
- computationally complex
- data sets
- lower complexity
- test cases
- multi objective