Vertex Sparsifiers and Abstract Rounding Algorithms
Moses CharikarTom LeightonShi LiAnkur MoitraPublished in: CoRR (2010)
Keyphrases
- data structure
- significant improvement
- linear programming
- decision trees
- case study
- computational complexity
- computationally efficient
- upper and lower bounds
- learning algorithm
- recently developed
- directed graph
- classification algorithm
- orders of magnitude
- theoretical analysis
- worst case
- computational cost
- objective function
- image sequences