Lower bounds for the relative greedy algorithm for approximating Steiner trees.
Stefan HougardyStefan KirchnerPublished in: Networks (2006)
Keyphrases
- greedy algorithm
- lower bound
- steiner tree
- linear programming relaxation
- objective function
- worst case
- knapsack problem
- greedy algorithms
- upper bound
- randomized algorithm
- approximation guarantees
- minimum spanning tree
- branch and bound
- optimal solution
- branch and bound algorithm
- influence maximization
- shortest path
- dynamic programming
- np hard
- greedy strategy
- lower and upper bounds
- set cover
- online algorithms
- facility location
- evolutionary algorithm
- lagrangian relaxation
- linear programming
- influence spread