A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph.
Vincenzo AulettaYefim DinitzZeev NutovDomenico ParentePublished in: J. Algorithms (1999)
Keyphrases
- experimental evaluation
- detection algorithm
- computational complexity
- times faster
- dynamic programming
- optimization algorithm
- cost function
- expectation maximization
- computational cost
- matching algorithm
- worst case
- randomized algorithm
- segmentation algorithm
- theoretical analysis
- np hard
- significant improvement
- preprocessing
- high accuracy
- simulated annealing
- evolutionary algorithm
- objective function
- image segmentation
- learning algorithm
- genetic algorithm