Polynomial Time Algorithms for Bichromatic Problems.
Sayan BandyapadhyayAritra BanikPublished in: CoRR (2016)
Keyphrases
- optimization problems
- practical problems
- test problems
- benchmark problems
- computational complexity
- learning algorithm
- problems in computer vision
- exact algorithms
- computational cost
- worst case
- combinatorial optimization
- approximate solutions
- partial solutions
- difficult problems
- np hardness
- related problems
- minimum cost flow
- search methods
- np complete
- significant improvement
- combinatorial optimization problems
- orders of magnitude
- theoretical analysis
- computationally efficient
- multi dimensional
- computational geometry
- database systems
- computationally hard
- genetic algorithm