Polynomial algorithms for restricted Euclidean p-centre problems.
Larry AupperleJ. Mark KeilPublished in: Discret. Appl. Math. (1989)
Keyphrases
- optimization problems
- inference problems
- problems in computer vision
- test problems
- practical problems
- computer vision
- hard problems
- greedy algorithms
- difficult problems
- benchmark problems
- computational cost
- combinatorial optimization
- computationally hard
- data mining
- computational problems
- approximate solutions
- data structure
- significant improvement
- theoretical analysis
- data mining tasks
- partial solutions
- data mining techniques
- bayesian networks
- exact algorithms
- specific problems
- convergence rate
- similarity measure
- feature selection
- search methods
- np hard problems
- run times