Algorithms for Implicit Hitting Set Problems
Karthekeyan ChandrasekaranRichard M. KarpErick Moreno-CentenoSantosh S. VempalaPublished in: CoRR (2011)
Keyphrases
- practical problems
- polynomial time complexity
- np hard problems
- optimization problems
- learning algorithm
- partial solutions
- difficult problems
- np complete
- times faster
- combinatorial optimization
- neural network
- computational problems
- nearest neighbour
- heuristic methods
- benchmark problems
- data sets
- test problems
- worst case
- small number
- significant improvement
- hard problems
- efficient solutions
- convex optimization problems
- objective function
- optimization criteria
- computational complexity
- exact algorithms
- problems in computer vision
- theoretical analysis
- lower and upper bounds
- orders of magnitude
- graph theory