Create a mst where each vertex has a given maximum visits

Viewed 46

example: I need to rewire the computer network at school, using as little cable as possible. So I create an MST of the existing routes. Now there is a problem, I am not allowed to buy additional routers. And the current routers (vertexes) are limited by the number of ports for further connection 2, 4,6 or 10.

How do I calculate my minimum spanning tree for this problem?

1 Answers
Related