Optimal Tile Salvage

Abstract

A map is a tiling of a finite region of the plane with unit squares such that some tiles have been removed. The optimal x x y-Tile Salvage Problem is: Given a map, find the maximum number of non-overlapping x x y tiled rectangles. A polynomial lime algorithm is given for the 1 x 2 case, Le., adjacent pairs. It is shown that the problem is NP-complete for… (More)

Topics

21 Figures and Tables

Slides referencing similar topics