Faster Algorithms for Semi-matching Problems (Extended Abstract).
Jittat FakcharoenpholBundit LaekhanukitDanupon NanongkaiPublished in: ICALP (1) (2010)
Keyphrases
- extended abstract
- optimization problems
- benchmark problems
- difficult problems
- test problems
- combinatorial optimization
- np hard problems
- problems in computer vision
- computational cost
- practical problems
- related problems
- orders of magnitude
- data mining algorithms
- computational complexity
- hard problems
- highly efficient
- search methods
- data structure
- benchmark datasets
- object recognition
- computationally efficient
- run times
- graph matching
- convex optimization problems
- exact and approximate
- theoretical guarantees
- computational geometry
- memory efficient
- significant improvement
- np hard
- worst case
- heuristic methods
- image matching
- decision problems
- graph theory