A Better Approximation Algorithm for Finding Planar Subgraphs.
Gruia CalinescuCristina G. FernandesUlrich FinklerHoward J. KarloffPublished in: J. Algorithms (1998)
Keyphrases
- optimization algorithm
- learning algorithm
- improved algorithm
- preprocessing
- times faster
- high accuracy
- detection algorithm
- similarity measure
- dynamic programming
- objective function
- computational complexity
- k means
- significant improvement
- computational cost
- approximation schemes
- error bounds
- matching algorithm
- worst case
- cost function
- expectation maximization
- probabilistic model
- convex hull
- experimental evaluation
- recognition algorithm
- graph structure
- optimal solution