-edge connected spanning subgraph by LP-rounding.
Harold N. GabowMichel X. GoemansÉva TardosDavid P. WilliamsonPublished in: Networks (2009)
Keyphrases
- linear programming
- mixed integer
- np hard
- linear program
- edge detection
- edge information
- feasible solution
- linear programming relaxation
- weighted graph
- approximation algorithms
- objective function
- primal dual
- edge detector
- dynamic programming
- optimal solution
- active contours
- lower bound
- multiple scales
- image processing
- simplex method
- lp norm
- algorithm for linear programming