Worst-Case Performance of Rayward-Smith's Steiner Tree Heuristic.
Bernard M. WaxmanMakoto ImasePublished in: Inf. Process. Lett. (1988)
Keyphrases
- steiner tree
- worst case
- minimum spanning tree
- running times
- worst case analysis
- linear programming relaxation
- lower bound
- average case
- facility location
- np hard
- upper bound
- greedy algorithm
- shortest path
- optimal solution
- graph theory
- dynamic programming
- tabu search
- branch and bound
- packing problem
- spanning tree
- combinatorial optimization
- mathematical model
- search algorithm