Near-Optimal Algorithms for Point-Line Covering Problems.
Jianer ChenQin HuangIyad KanjGe XiaPublished in: CoRR (2020)
Keyphrases
- optimization problems
- benchmark problems
- difficult problems
- np hard problems
- test problems
- computationally efficient
- neural network
- computational problems
- efficient solutions
- practical problems
- orders of magnitude
- theoretical analysis
- combinatorial optimization
- hard problems
- learning algorithm
- specific problems
- data mining tasks
- exact algorithms
- computational complexity
- data sets
- computationally hard
- image sequences
- approximate solutions
- significant improvement
- worst case
- graph theory
- simulated annealing
- computational efficiency
- particle swarm optimization