Optimal Packing and Covering in the Plane are NP-Complete.

Robert J. Fowler Mike Paterson Steven L. Tanimoto

Published in: Inf. Process. Lett. (1981)

Keyphrases

np complete
randomly generated
optimal design
np hard
dynamic programming
worst case
three dimensional
satisfiability problem
bounded treewidth
information systems
optimal solution
upper bound
closed form
conjunctive queries