A Divide and Conquer Approximation Algorithm for Partitioning Rectangles.
Reyhaneh MohammadiMehdi BehrooziPublished in: CoRR (2023)
Keyphrases
- experimental evaluation
- objective function
- learning algorithm
- cost function
- theoretical analysis
- matching algorithm
- np hard
- monte carlo
- probabilistic model
- approximation ratio
- significant improvement
- search space
- computational complexity
- dynamic programming
- computational cost
- expectation maximization
- optimal solution
- convergence rate
- greedy algorithm
- times faster
- partitioning algorithm
- optimization algorithm
- computationally efficient
- particle swarm optimization
- high accuracy
- worst case
- multi objective
- special case