On the minimum routing cost clustered tree problem
For an edge-weighted graph G=(V, E, w) G=(V, E, w), in which the vertices are partitioned
into k clusters R={R_1, R_2, ..., R_k\} R= R 1, R 2,…, R k, a spanning tree T of G is a …
into k clusters R={R_1, R_2, ..., R_k\} R= R 1, R 2,…, R k, a spanning tree T of G is a …
An extended mathematical programming model to optimize the cable trench route of power transmission in a metro depot
A Jamili, F Ramezankhani - 2015 - sid.ir
The necessary electricity of the workshops and buildings (W& Bs) located at the METRO
DEPOT are provided by LIGHTING POWER SUBSTATION (LPS). To transmit electricity …
DEPOT are provided by LIGHTING POWER SUBSTATION (LPS). To transmit electricity …
Distributed local multi-aggregation and centrality approximation
We study local aggregation and graph analysis in distributed environments using the
message passing model. We provide a flexible framework, where each of the nodes in a set …
message passing model. We provide a flexible framework, where each of the nodes in a set …
An Approximation Algorithm for Star p-Hub Routing Cost Problem
Given a metric graph G=(V, E, w), a center c ∈ V, and an integer p, we discuss the Star p-
Hub Routing Cost Problem in this paper. We want obtain a depth-2 tree which has a root …
Hub Routing Cost Problem in this paper. We want obtain a depth-2 tree which has a root …