Dwi Sakethi

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
Given edge weighted graph G(V,E) (all weights are nonnegative) where vertices can represent terminals, cities, etc., and edges can represent cables, road, etc., the Multi Period Degree Constrained Minimum Spanning Tree Problem (MPDCMST) is a problem of finding the total minimum installation cost whilst also maintaining the maximum number of edges incidence(More)
  • 1