A 1.598 Approximation Algorithm for the Steiner Problem in Graphs.
Stefan HougardyHans Jürgen PrömelPublished in: SODA (1999)
Keyphrases
- dynamic programming
- detection algorithm
- experimental evaluation
- graph structure
- objective function
- np hard
- learning algorithm
- times faster
- worst case
- computational cost
- significant improvement
- k means
- computational complexity
- graph isomorphism
- cost function
- neural network
- recognition algorithm
- ant colony optimization
- optimization algorithm
- segmentation algorithm
- simulated annealing
- theoretical analysis
- optimal solution
- closed form
- feature selection
- high accuracy
- preprocessing
- graph construction
- search space