AbstractIn a treelike communication network, transmission equipment is required for the internal vertices. We consider optimal schedules for the construction of the edges of the network, minimizing the cost of hiring the transmission equipment during the construction process.
Properties of optimal schedules are investigated. It is shown that an optimal schedule is constructed in three parts: The initial matching, the stars part and the residual sub graph. Rules concerning the construction of each one of the parts are presented. Efficient algorithms are presented for some special cases of paths of stars.
RightsThis Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).