Ekaterina Shin

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The minimum spanning trees problem is to find k edge-disjoint spanning trees in a given undirected weighted graph. It can be solved in polynomial time. In the k minimum spanning trees problem with diameter bounded below (k-MSTBB) there is an additional requirement: a diameter of every spanning tree must be not less than some predefined value d. The k-MSTBB(More)
  • 1