Approximating Subdense Instances of Covering Problems.

Jean Cardinal Marek Karpinski Richard Schmied Claus Viehmann

Published in: Electron. Notes Discret. Math. (2011)

Keyphrases

multi agent
problems involving
run times
information retrieval
optimization problems
np complete
test problems
test instances
neural network
genetic algorithm
lower bound
metaheuristic
decision problems
randomly generated
solving problems
tractable cases