Fast algorithms for convex cost flow problems on circles, lines, and trees.
James B. OrlinBalachandran VaidyanathanPublished in: Networks (2013)
Keyphrases
- optimization problems
- benchmark problems
- convex optimization problems
- computational geometry
- computational cost
- minimization problems
- hough transform
- theoretical guarantees
- significant improvement
- run times
- exact algorithms
- problems in computer vision
- convex functions
- approximate solutions
- search methods
- convex hull
- combinatorial optimization
- computationally efficient
- np complete
- computational complexity
- semi definite programming
- linearly constrained