On the Hardness of Approximating Minimum Monopoly Problems.
S. MishraJaikumar RadhakrishnanSivaramakrishnan SivasubramanianPublished in: FSTTCS (2002)
Keyphrases
- np complete
- solving problems
- difficult problems
- problems involving
- mathematical programming
- benchmark problems
- search algorithm
- optimization problems
- related problems
- decision problems
- application domains
- neural network
- np hard
- artificial neural networks
- bayesian networks
- knowledge base
- information systems
- computer vision
- artificial intelligence
- data mining