Description: kthtree problems to be fixed to a tree T, T trees each vertex u have a right to w (u); Tree edges (u, v) also have a non-negative side length d (u, v). T to a tree each vertex u can be seen as customers, the demand for its services w (u). Edges (u, v) of length d (u, v) can be considered as transportation costs. If the vertex u Department had not set up the service agencies, will be the culmination u demand for services to a tree along the edge (u, v) v transferred to Vertex's services agencies are required to pay a service fee for the transfer of w (u)* d (u, v). Christopher has set up a service sector, is now in the tree to add k T's services agencies, T entire tree makes the shift to the smallest cost
To Search:
File list (Check if you may need any files):
Download