A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2.
Piotr BermanMarek KarpinskiAlexander ZelikovskyPublished in: ISAAC (1) (2010)
Keyphrases
- minimum spanning tree
- np hard
- dynamic programming
- undirected graph
- optimal solution
- steiner tree
- simulated annealing
- computational complexity
- weighted graph
- segmentation algorithm
- worst case
- probabilistic model
- cost function
- search space
- linear programming
- ant colony optimization
- knapsack problem
- approximation algorithms