Grade of service steiner minimum trees in the Euclidean plane

Mathematics

• Euclidean plane 100%
• Pi 32%
• Costs 28%
• Euclidean 19%
• Topology 16%
• Approximation Algorithms 13%
• Steiner Point 11%
• Branch and Bound Method 10%
• Pruning 10%
• Interior-point Algorithm 10%
• Branch and Bound Algorithm 9%
• Performance 9%
• Heuristic algorithm 9%
• Optimal Algorithm 8%
• Point Sets 7%
• Computational Results 7%
• Polynomial-time Algorithm 7%
• Path 5%
• Lower bound 5%
• Approximation 4%
• Generalization 4%
• Theorem 3%

Engineering & Materials Science

• Approximation algorithms 37%
• Topology 35%
• Costs 33%
• Branch and bound method 24%
• Heuristic algorithms 17%
• Polynomials 13%