Ultimate greedy approximation of independent sets in subcubic graphs.
Piotr KrystaMathieu MariNan ZhiPublished in: SODA (2020)
Keyphrases
- greedy algorithm
- search algorithm
- relative error
- upper approximation
- approximation error
- closed form
- graph clustering
- graph theory
- graph theoretic
- graph structure
- approximation ratio
- convex sets
- data sets
- approximation algorithms
- graph matching
- dynamic programming
- feature selection
- pattern recognition
- subgraph isomorphism
- series parallel