A New Algorithm Based on Colouring Arguments for Identifying Impossible Polyomino Tiling Problems.
Marcus R. GarvieJohn BurkardtPublished in: Algorithms (2022)
Keyphrases
- experimental evaluation
- dynamic programming
- np hard
- detection algorithm
- optimization algorithm
- benchmark problems
- k means
- computational complexity
- learning algorithm
- preprocessing
- cost function
- iterative algorithms
- matching algorithm
- search space
- optimal solution
- computational cost
- test problems
- convergence rate
- combinatorial optimization
- theoretical guarantees
- genetic algorithm
- path planning
- conflict free
- segmentation algorithm
- theoretical analysis
- computationally efficient
- particle swarm optimization
- linear programming
- worst case
- scheduling problem
- objective function
- bayesian networks