Solving hard optimization problems of packing, covering, and tiling via clique search

In the paper we propose to convert NP-hard combinatorial optimization problems of packing, covering, and tiling types into maximum or k-clique problems. The key step is to come up with a tactically co