A Local Algorithm for Constructing Spanners in Minor-Free Graphs.
Reut LeviDana RonRonitt RubinfeldPublished in: CoRR (2016)
Keyphrases
- experimental evaluation
- preprocessing
- learning algorithm
- dynamic programming
- optimization algorithm
- np hard
- expectation maximization
- improved algorithm
- graph structure
- detection algorithm
- k means
- linear programming
- graph theoretical
- times faster
- theoretical analysis
- computationally efficient
- worst case
- probabilistic model
- search space
- high accuracy
- input data
- cost function
- significant improvement
- tree structure
- matching algorithm
- computational complexity
- recognition algorithm
- search algorithm
- weighted graph
- optimal solution
- undirected graph
- objective function