-edge connected spanning subgraph by LP-rounding.
Harold N. GabowMichel X. GoemansÉva TardosDavid P. WilliamsonPublished in: SODA (2005)
Keyphrases
- linear programming
- np hard
- mixed integer
- linear program
- linear programming relaxation
- edge detector
- edge detection
- feasible solution
- graph mining
- edge information
- connected components
- lower bound
- integer programming
- optimal solution
- objective function
- data sets
- approximation algorithms
- weighted graph
- edge weights
- subgraph matching
- mixed integer programming
- data mining