Reduction rules deliver efficient FPT-algorithms for covering points with lines.
Vladimir Estivill-CastroApichat HeednacramFrancis SuraweeraPublished in: ACM J. Exp. Algorithmics (2009)
Keyphrases
- computationally expensive
- learning algorithm
- computationally efficient
- computational cost
- efficient implementation
- algorithmic solutions
- highly scalable
- data structure
- computational complexity
- neural network
- optimization problems
- theoretical analysis
- computationally demanding
- computationally complex
- pruning strategy
- efficient solutions
- computationally intensive
- straight line
- line segments
- feature points
- high dimensional