Polynomial Time Algorithms for Bichromatic Problems.
Sayan BandyapadhyayAritra BanikPublished in: CALDAM (2017)
Keyphrases
- benchmark problems
- computational complexity
- test problems
- related problems
- learning algorithm
- np complete
- optimization problems
- greedy algorithms
- difficult problems
- combinatorial optimization
- search methods
- worst case
- problems in computer vision
- computational problems
- polynomial time complexity
- computationally efficient
- computationally hard
- approximate solutions
- practical problems
- run times
- data mining
- evolutionary algorithm
- query processing
- significant improvement