Packing 2×2 unit squares into grid polygons is NP-complete.
Dania El-KhechenMuriel DulieuJohn IaconoNikolaj van OmmePublished in: CCCG (2009)
Keyphrases
- np complete
- np hard
- computational complexity
- randomly generated
- constraint satisfaction problems
- satisfiability problem
- packing problem
- pspace complete
- conjunctive queries
- grid points
- hough transform
- grid computing
- control unit
- bounded treewidth
- polynomial time complexity
- grid structure
- grid services
- phase transition
- convex hull
- scheduling problem
- cnf formula
- data complexity
- np complete problems
- upper bound
- special case
- conp complete
- grid enabled
- relational databases