Near-Optimal Algorithms for Point-Line Covering Problems.
Jianer ChenQin HuangIyad KanjGe XiaPublished in: STACS (2022)
Keyphrases
- optimization problems
- benchmark problems
- practical problems
- computationally efficient
- np hard problems
- computational cost
- computational complexity
- significant improvement
- computational problems
- partial solutions
- hard problems
- test problems
- related problems
- problems in computer vision
- exact and approximate
- approximate solutions
- search problems
- greedy algorithms
- combinatorial optimization
- times faster
- orders of magnitude
- np complete
- combinatorial problems
- computationally hard
- efficient solutions
- single point
- computer vision
- graph theory
- search methods
- image segmentation