A network-flow technique for finding low-weight bounded-degree spanning trees

INIS

• algorithms 100%
• approximations 16%
• constraints 50%
• distance 16%
• euclidean space 16%
• geometry 16%
• graphs 50%
• length 16%
• norm 16%
• performance 66%
• topology 16%
• weight 100%
• yields 33%

Computer Science

• Algorithms 83%
• Approximation Algorithms 16%
• Computing 16%
• Degree Constraint 50%
• Functions 16%
• Geometric Graph 16%
• Minimum Spanning Tree 33%
• Networks 33%
• Performance Guarantee 66%
• Spanning Tree 50%
• Topology 16%
• Traveling Salesman 16%
• Triangle Inequality 16%