A note on the NP-hardness of two matching problems in induced subgrids.

Marc Demange Tínaz Ekim

Published in: Discret. Math. Theor. Comput. Sci. (2013)

Keyphrases

np hardness
np hard
approximation algorithms
worst case analysis
decision making
search space
tabu search
mixed integer programming