2000 character limit reached
Asymptotic Results for the Queen Packing Problem (1703.04538v1)
Published 13 Mar 2017 in math.CO
Abstract: We consider the problem of placing k queens on an nxn board so that the total number of attacked squares is as small as possible. In particular, we consider the domain where k is small relative to n and derive nearly tight bounds in this setting.
Collections
Sign up for free to add this paper to one or more collections.