Minimum dominating set of queens: a trivial programming exercise?
From MaRDI portal
Publication:968146
DOI10.1016/j.dam.2009.09.019zbMath1185.90212MaRDI QIDQ968146
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.019
parameterized algorithms; exact algorithms; domination problems; \(\mathcal {NP}\)-completeness; chess problems
90C60: Abstract computational complexity for mathematical programming problems
90C39: Dynamic programming