Algorithms for Implicit Hitting Set Problems.
Karthekeyan ChandrasekaranRichard M. KarpErick Moreno-CentenoSantosh S. VempalaPublished in: SODA (2011)
Keyphrases
- optimization problems
- np complete
- related problems
- difficult problems
- polynomial time complexity
- combinatorial optimization
- worst case
- hard problems
- benchmark problems
- partial solutions
- problems in computer vision
- theoretical analysis
- orders of magnitude
- practical problems
- exact algorithms
- nearest neighbour
- optimization criteria
- data mining tasks
- test problems
- data mining algorithms
- small number
- computational cost
- significant improvement
- computationally hard
- np hard problems
- stationary points
- minimum cost
- computational problems
- decomposition algorithm
- theoretical guarantees
- convex functions
- packing problem
- neural network
- search methods
- computational complexity
- data structure
- learning algorithm