On the hardness of covering-interdiction problems.

Nicolas Fröhlich Stefan Ruzika

Published in: Theor. Comput. Sci. (2021)

Keyphrases

np complete
computational complexity
neural network
np hard
optimization problems
application domains
problems involving
data sets
machine learning
social networks
information systems
phase transition
practical problems
np hardness