Dynamic programming approach to the generalized minimum manhattan network problem

Computer Science

• Networks 100%
• Dynamic Programming 40%
• Intersection Graph 40%
• Approximation Algorithms 20%
• Polynomial Time Algorithm 20%
• Polynomial Time 20%
• Constant Factor 20%
• Shortest Path 20%
• Dynamic Programming Algorithm 20%
• Network Design Problem 20%

Mathematics

• Intersection Graph 40%
• Polynomial Time 20%
• Euclidean Plane 20%
• Points 20%
• Bounds 20%
• Constant 20%
• Trees 20%
• Constant Factor 20%
• Rectilinear 20%